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.

A382624 Positive integers such that every even digit except the leftmost is immediately preceded by a larger digit.

This page as a plain text file.
%I A382624 #12 Apr 09 2025 01:10:00
%S A382624 1,2,3,4,5,6,7,8,9,10,11,13,15,17,19,20,21,23,25,27,29,30,31,32,33,35,
%T A382624 37,39,40,41,42,43,45,47,49,50,51,52,53,54,55,57,59,60,61,62,63,64,65,
%U A382624 67,69,70,71,72,73,74,75,76,77,79,80,81,82,83,84,85,86,87,89,90
%N A382624 Positive integers such that every even digit except the leftmost is immediately preceded by a larger digit.
%C A382624 Conjecture: these are the terms of A382621, sorted.
%H A382624 Paolo Xausa, <a href="/A382624/b382624.txt">Table of n, a(n) for n = 1..10000</a>
%t A382624 A382624Q[k_] := FreeQ[Partition[IntegerDigits[k], 2, 1], {i_, j_?EvenQ} /; i <= j];
%t A382624 Select[Range[100], A382624Q]
%o A382624 (Python)
%o A382624 def ok(n):
%o A382624     s = str(n)
%o A382624     return all(s[i+1] < s[i] for i in range(len(s)-1) if s[i+1] in "02468")
%o A382624 print([k for k in range(1, 91) if ok(k)]) # _Michael S. Branicky_, Apr 03 2025
%Y A382624 Cf. A377912, A382465, A382621, A382623 (complement).
%K A382624 nonn,base,easy
%O A382624 1,2
%A A382624 _Paolo Xausa_, Apr 01 2025