A383061 -id:A383061 - cp's OEIS frontend

A382464 Positive integers that contain an even digit d immediately preceded by a digit >= d.

10, 20, 22, 30, 32, 40, 42, 44, 50, 52, 54, 60, 62, 64, 66, 70, 72, 74, 76, 80, 82, 84, 86, 88, 90, 92, 94, 96, 98, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 120, 122, 130, 132, 140, 142, 144, 150, 152, 154, 160, 162, 164, 166, 170, 172, 174, 176, 180

Offset: 1

Paolo Xausa, Mar 28 2025

Conjecture: these are the numbers missing from A382462.

Paolo Xausa, Table of n, a(n) for n = 1..10000

Cf. A382462, A382465 (complement).

Cf. A347298, A382623, A382937, A383061, A383245, A383247, A383249, A383500.

A382464Q[k_] := MemberQ[Partition[IntegerDigits[k], 2, 1], {i_, j_?EvenQ} /; i >= j];
Select[Range[200], A382464Q]

def ok(n):
    s = str(n)
    return any(d in "02468" and s[i-1]>=d for i, d in enumerate(s) if i > 0)
print([k for k in range(181) if ok(k)]) # Michael S. Branicky, Apr 30 2025

A383062 Nonnegative integers such that every odd digit except the leftmost is immediately preceded by a smaller digit.

Original entry on oeis.org

0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 13, 14, 15, 16, 17, 18, 19, 20, 22, 23, 24, 25, 26, 27, 28, 29, 30, 32, 34, 35, 36, 37, 38, 39, 40, 42, 44, 45, 46, 47, 48, 49, 50, 52, 54, 56, 57, 58, 59, 60, 62, 64, 66, 67, 68, 69, 70, 72, 74, 76, 78, 79, 80, 82, 84, 86, 88, 89, 90

Offset: 1

Paolo Xausa, Apr 18 2025

Conjecture: these are the terms of A383059, sorted.

Paolo Xausa, Table of n, a(n) for n = 1..10000

Cf. A383059, A383061 (complement).

Cf. A377912, A382465, A382624, A382938, A383246, A383248, A383250, A383501.

A383062Q[k_] := FreeQ[Partition[IntegerDigits[k], 2, 1], {i_, j_?OddQ} /; i >= j];
Select[Range[0, 100], A383062Q]

def ok(n):
    s = str(n)
    return all(s[i+1] > s[i] for i in range(len(s)-1) if s[i+1] in "13579")
print([k for k in range(91) if ok(k)]) # Michael S. Branicky, Apr 19 2025

A382937 Positive integers that contain an odd digit d immediately preceded by a digit <= d.

Original entry on oeis.org

11, 13, 15, 17, 19, 23, 25, 27, 29, 33, 35, 37, 39, 45, 47, 49, 55, 57, 59, 67, 69, 77, 79, 89, 99, 101, 103, 105, 107, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 123, 125, 127, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 145, 147, 149, 150

Offset: 1

Paolo Xausa, Apr 14 2025

Paolo Xausa, Table of n, a(n) for n = 1..10000

Cf. A382938 (complement).

Cf. A347298, A382464, A382623, A383061, A383245, A383247, A383249, A383500.

A382937Q[k_] := MemberQ[Partition[IntegerDigits[k], 2, 1], {i_, j_?OddQ} /; i <= j];
Select[Range[200], A382937Q]

def ok(n):
    s = str(n)
    return any(s[i+1] >= s[i] for i in range(len(s)-1) if s[i+1] in "13579")
print([k for k in range(1, 151) if ok(k)]) # Michael S. Branicky, Apr 14 2025

A383245 Nonnegative integers that contain the digit 0, or an even digit d immediately followed by a digit >= d.

Original entry on oeis.org

0, 10, 20, 22, 23, 24, 25, 26, 27, 28, 29, 30, 40, 44, 45, 46, 47, 48, 49, 50, 60, 66, 67, 68, 69, 70, 80, 88, 89, 90, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 120, 122, 123, 124, 125, 126, 127, 128, 129, 130, 140, 144, 145, 146, 147, 148, 149, 150, 160, 166

Offset: 1

Paolo Xausa, Apr 20 2025

Conjecture: these are the numbers missing from A342043.

Paolo Xausa, Table of n, a(n) for n = 1..10000

Cf. A342043, A383246 (complement).

Cf. A347298, A382464, A382623, A382937, A383061, A383247, A383249, A383500.

A383245Q[k_] := MemberQ[#, 0] || MemberQ[Partition[#, 2, 1], {i_?EvenQ, j_} /; j >= i] & [IntegerDigits[k]];
Select[Range[0, 200], A383245Q]

def ok(n):
    if n%10 == 0: return True
    s = str(n)
    return any(d in "02468" and s[i]>=d for i, d in enumerate(s, 1) if i < len(s))
print([k for k in range(167) if ok(k)]) # Michael S. Branicky, Apr 28 2025

A383247 Positive integers that contain the digit 9, or an odd digit d immediately followed by a digit <= d.

Original entry on oeis.org

9, 10, 11, 19, 29, 30, 31, 32, 33, 39, 49, 50, 51, 52, 53, 54, 55, 59, 69, 70, 71, 72, 73, 74, 75, 76, 77, 79, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 129, 130, 131, 132, 133

Offset: 1

Paolo Xausa, Apr 25 2025

Conjecture: these are the numbers missing from A342044.

Paolo Xausa, Table of n, a(n) for n = 1..10000

Cf. A342044, A383248 (complement).

Cf. A347298, A382464, A382623, A382937, A383061, A383245, A383249.

A383247Q[k_] := MemberQ[#, 9] || MemberQ[Partition[#, 2, 1], {i_?OddQ, j_} /; j <= i] & [IntegerDigits[k]];
Select[Range[200], A383247Q]

def ok(n):
    s = str(n)
    return "9" in s or any(d in "13579" and s[i]<=d for i, d in enumerate(s, 1) if i < len(s))
print([k for k in range(134) if ok(k)]) # Michael S. Branicky, Apr 28 2025

A383249 Positive integers ending with the digit 1, or containing an odd digit d immediately followed by a digit >= d.

Original entry on oeis.org

1, 11, 12, 13, 14, 15, 16, 17, 18, 19, 21, 31, 33, 34, 35, 36, 37, 38, 39, 41, 51, 55, 56, 57, 58, 59, 61, 71, 77, 78, 79, 81, 91, 99, 101, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135

Offset: 1

Paolo Xausa, Apr 26 2025

Conjecture: these are the numbers missing from A342045.

By way of disjointness and completeness, it is proved that this sequence is the complement of A342045. - Quinn Savitt, Apr 29 2025

Paolo Xausa, Table of n, a(n) for n = 1..10000
Quinn Savitt, Proof that A383249 is the complement of A342045

Cf. A342045, A383250 (complement).

Cf. A347298, A382464, A382623, A382937, A383061, A383245, A383247.

A383249Q[k_] := Last[#] == 1 || MemberQ[Partition[#, 2, 1], {i_?OddQ, j_} /; j >= i] & [IntegerDigits[k]];
Select[Range[200], A383249Q]

def ok(n):
    if n%10 == 1: return True
    s = str(n)
    return any(d in "13579" and s[i]>=d for i, d in enumerate(s, 1) if i < len(s))
print([k for k in range(136) if ok(k)]) # Michael S. Branicky, Apr 28 2025

A383059 Lexicographically earliest sequence of distinct nonnegative integers such that if a digit d in the digit stream (ignoring commas) is odd, the previous digit is < d.

Original entry on oeis.org

0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 20, 10, 12, 22, 23, 24, 25, 26, 27, 28, 29, 40, 13, 42, 30, 14, 44, 45, 46, 47, 48, 49, 60, 15, 62, 32, 34, 50, 16, 64, 52, 35, 66, 67, 68, 69, 80, 17, 82, 36, 70, 18, 84, 54, 56, 72, 37, 86, 74, 57, 88, 89, 200, 19, 201, 38, 90, 39, 202, 58

Offset: 1

Paolo Xausa, Apr 18 2025

Could be summarized as "odd digit, previous smaller". A variant of A342042.

Paolo Xausa, Table of n, a(n) for n = 1..10000
Paolo Xausa, Color scatterplot of the first 100000 terms

Similar sequences: A342042, A342043, A342044, A342045, A382462, A382621, A382935.

Cf. A383060, A383061, A383062, A383063.

A383059list[nmax_] := Module[{a, s, invQ, fu = 1},
  invQ[k_] := invQ[k] = (If[#, s[k] = #]; #) & [MemberQ[Partition[IntegerDigits[k], 2, 1], {i_, j_?OddQ} /; i >= j]];
  s[_] := False; s[0] = True;
  NestList[(a = fu; While[s[a] || invQ[a] || invQ[# + First[IntegerDigits[a]]], a++] & [Mod[#, 10]*10]; While[s[fu], fu++]; s[a] = True; a) &, 0, nmax - 1]];
A383059list[100]

from itertools import count, islice
def cond(s):
    return all(s[i] > s[i-1] for i in range(1, len(s)) if s[i] in "13579")
def agen(): # generator of terms
    an, seen, s, m = 0, {0}, "0", 1
    while True:
        yield an
        an = next(k for k in count(m) if k not in seen and cond(s[-1]+str(k)))
        seen.add(an); s += str(an)
        while m in seen or not cond(str(m)): m += 1
print(list(islice(agen(), 70))) # Michael S. Branicky, Apr 19 2025

A383500 Positive integers that contain the digit 9, or an odd digit d immediately preceded by a digit <= d.

Original entry on oeis.org

9, 11, 13, 15, 17, 19, 23, 25, 27, 29, 33, 35, 37, 39, 45, 47, 49, 55, 57, 59, 67, 69, 77, 79, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 101, 103, 105, 107, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 123, 125, 127, 129, 130, 131, 132, 133, 134, 135, 136, 137

Offset: 1

Paolo Xausa, Apr 29 2025

Conjecture: these are the numbers missing from A382935.

Theorem: This sequence is the complement of A382935. - Quinn Savitt, May 08 2025

Paolo Xausa, Table of n, a(n) for n = 1..10000
Quinn Savitt, Proof that A383500 is the Complement of A382935

Cf. A382935, A383501 (complement).

Cf. A347298, A382464, A382623, A382937, A383061, A383245, A383247, A383249.

A383500Q[k_] := MemberQ[#, 9] || MemberQ[Partition[#, 2, 1], {i_, j_?OddQ} /; i <= j] & [IntegerDigits[k]];
Select[Range[200], A383500Q]

def ok(n):
    s = str(n)
    return "9" in s or any(d in "13579" and s[i-1]<=d for i, d in enumerate(s) if i > 0)
print([k for k in range(134) if ok(k)]) # Michael S. Branicky, Apr 29 2025

cp's OEIS Frontend

A382464 Positive integers that contain an even digit d immediately preceded by a digit >= d.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

Python

A383062 Nonnegative integers such that every odd digit except the leftmost is immediately preceded by a smaller digit.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

Python

A382937 Positive integers that contain an odd digit d immediately preceded by a digit <= d.

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

Python

A383245 Nonnegative integers that contain the digit 0, or an even digit d immediately followed by a digit >= d.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

Python

A383247 Positive integers that contain the digit 9, or an odd digit d immediately followed by a digit <= d.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

Python

A383249 Positive integers ending with the digit 1, or containing an odd digit d immediately followed by a digit >= d.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

Python

A383059 Lexicographically earliest sequence of distinct nonnegative integers such that if a digit d in the digit stream (ignoring commas) is odd, the previous digit is < d.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

Python

A383500 Positive integers that contain the digit 9, or an odd digit d immediately preceded by a digit <= d.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

Python