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.

A095899 Numbers n such that b(n)/n - 1/2 < 1/k for all k > n, where b(n) is A004001.

This page as a plain text file.
%I A095899 #9 Feb 16 2025 08:32:53
%S A095899 1,1,1,1,6,6,11,13,25,44,46,52,98,180,186,372,396,747,1489,1563,3003,
%T A095899 6059,11787,22251,47152,89524,188871,361441,758765,207115,411023,
%U A095899 826893,1642957,3308167,6574193
%N A095899 Numbers n such that b(n)/n - 1/2 < 1/k for all k > n, where b(n) is A004001.
%H A095899 Mathenomicon, <a href="http://www.cenius.net/refer/display.php?ArticleID=hofstadterconwaysequence">Hofstadter-Conway Sequence.</a>
%H A095899 N. J. A. Sloane, <a href="http://neilsloane.com/doc/sg.txt">My favorite integer sequences</a>, in Sequences and their Applications (Proceedings of SETA '98).
%H A095899 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/Hofstadter-Conway10000-DollarSequence.html">Hofstadter-Conway 10000-Dollar Sequence.</a>
%t A095899 a[1] = a[2] = 1; a[n_] := a[n] = a[a[n - 1]] + a[n - a[n - 1]]; Do[ a[n], {n, 10000000}]; f[n_] := Block[{k = C}, While[ a[k]/k - 1/2 < 1/n, k-- ]; k] (C is a number generally twice as large as the previous answer) (* _Robert G. Wilson v_, Jun 11 2004 *)
%Y A095899 Cf. A004001.
%K A095899 nonn
%O A095899 1,5
%A A095899 _Robert G. Wilson v_, Jun 11 2004