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 A385996 #12 Aug 01 2025 11:05:42 %S A385996 0,2,4,8,16,28,34,44,52,62,68,88,104,124,130,152,184,200,232,250,260, %T A385996 296,328,380,388,440,472,500,524,568,632,688,764,772,848,904,968,1012, %U A385996 1030,1064,1144,1232,1288,1424,1534,1538,1648,1784,1840,1928,2008,2038 %N A385996 a(n) is the least k such that some value appears n times among A002487(0), ..., A002487(k). %H A385996 Rémy Sigrist, <a href="/A385996/b385996.txt">Table of n, a(n) for n = 1..10000</a> %H A385996 Rémy Sigrist, <a href="/A385996/a385996.txt">C++ program</a> %H A385996 <a href="/index/St#Stern">Index entries for sequences related to Stern's sequences</a> %F A385996 A091948(a(n)) = n (this is the first occurrence of n in A091948). %o A385996 (C++) // See Links section. %Y A385996 See A385995 for the corresponding values. %Y A385996 Cf. A002487, A091948. %K A385996 nonn %O A385996 1,2 %A A385996 _Rémy Sigrist_, Jul 14 2025