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.
%I A364124 #7 Jul 07 2023 05:42:30
%S A364124 8,56,84,159,195,224,384,399,405,995,1140,1224,1245,1295,1309,1419,
%T A364124 1420,1455,1474,1507,2585,2597,2600,2680,2681,2727,2744,2750,2799,
%U A364124 2855,3122,3311,3339,3345,3618,3707,3795,4004,6770,6774,6984,6985,7014,7074,7154,7405
%N A364124 Numbers k such that k and k+1 are both Stolarsky-Niven numbers (A364123).
%H A364124 Amiram Eldar, <a href="/A364124/b364124.txt">Table of n, a(n) for n = 1..10000</a>
%t A364124 seq[count_, nConsec_] := Module[{cn = stolNivQ /@ Range[nConsec], s = {}, c = 0, k = nConsec + 1}, While[c < count, If[And @@ cn, c++; AppendTo[s, k - nConsec]]; cn = Join[Rest[cn], {stolNivQ[k]}]; k++]; s]; seq[50, 2] (* using the function stolNivQ[n] from A364123 *)
%o A364124 (PARI) lista(count, nConsec) = {my(cn = vector(nConsec, i, isStolNivQ(i)), c = 0, k = nConsec + 1); while(c < count, if(vecsum(cn) == nConsec, c++; print1(k-nConsec, ", ")); cn = concat(vecextract(cn, "^1"), isStolNivQ(k)); k++);} \\ using the function isA364123(n) from A364123
%o A364124 lista(50, 2)
%Y A364124 Subsequence of A364123.
%Y A364124 Subsequences: A364125, A364126.
%Y A364124 Similar sequences: A330927, A328205, A328209, A328213, A330931, A331086, A333427, A334309, A331820, A342427, A344342, A351715, A351720, A352090, A352108, A352321, A352343, A352509.
%K A364124 nonn,base
%O A364124 1,1
%A A364124 _Amiram Eldar_, Jul 07 2023