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.

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

This page as a plain text file.
%I A383062 #11 Apr 30 2025 11:08:42
%S A383062 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,
%T A383062 28,29,30,32,34,35,36,37,38,39,40,42,44,45,46,47,48,49,50,52,54,56,57,
%U A383062 58,59,60,62,64,66,67,68,69,70,72,74,76,78,79,80,82,84,86,88,89,90
%N A383062 Nonnegative integers such that every odd digit except the leftmost is immediately preceded by a smaller digit.
%C A383062 Conjecture: these are the terms of A383059, sorted.
%H A383062 Paolo Xausa, <a href="/A383062/b383062.txt">Table of n, a(n) for n = 1..10000</a>
%t A383062 A383062Q[k_] := FreeQ[Partition[IntegerDigits[k], 2, 1], {i_, j_?OddQ} /; i >= j];
%t A383062 Select[Range[0, 100], A383062Q]
%o A383062 (Python)
%o A383062 def ok(n):
%o A383062     s = str(n)
%o A383062     return all(s[i+1] > s[i] for i in range(len(s)-1) if s[i+1] in "13579")
%o A383062 print([k for k in range(91) if ok(k)]) # _Michael S. Branicky_, Apr 19 2025
%Y A383062 Cf. A383059, A383061 (complement).
%Y A383062 Cf. A377912, A382465, A382624, A382938, A383246, A383248, A383250, A383501.
%K A383062 nonn,base,easy
%O A383062 1,3
%A A383062 _Paolo Xausa_, Apr 18 2025