cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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

This page as a plain text file.
%I A383245 #15 Apr 30 2025 11:08:53
%S A383245 0,10,20,22,23,24,25,26,27,28,29,30,40,44,45,46,47,48,49,50,60,66,67,
%T A383245 68,69,70,80,88,89,90,100,101,102,103,104,105,106,107,108,109,110,120,
%U A383245 122,123,124,125,126,127,128,129,130,140,144,145,146,147,148,149,150,160,166
%N A383245 Nonnegative integers that contain the digit 0, or an even digit d immediately followed by a digit >= d.
%C A383245 Conjecture: these are the numbers missing from A342043.
%H A383245 Paolo Xausa, <a href="/A383245/b383245.txt">Table of n, a(n) for n = 1..10000</a>
%t A383245 A383245Q[k_] := MemberQ[#, 0] || MemberQ[Partition[#, 2, 1], {i_?EvenQ, j_} /; j >= i] & [IntegerDigits[k]];
%t A383245 Select[Range[0, 200], A383245Q]
%o A383245 (Python)
%o A383245 def ok(n):
%o A383245     if n%10 == 0: return True
%o A383245     s = str(n)
%o A383245     return any(d in "02468" and s[i]>=d for i, d in enumerate(s, 1) if i < len(s))
%o A383245 print([k for k in range(167) if ok(k)]) # _Michael S. Branicky_, Apr 28 2025
%Y A383245 Cf. A342043, A383246 (complement).
%Y A383245 Cf. A347298, A382464, A382623, A382937, A383061, A383247, A383249, A383500.
%K A383245 nonn,base,easy
%O A383245 1,2
%A A383245 _Paolo Xausa_, Apr 20 2025