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 A229170 #33 Aug 15 2025 05:55:17 %S A229170 2,3,5,7,10,13,17,21,25,30,35,40,45,51,56,62,68,74,80,87,93,100,106, %T A229170 113,120,127,134,141,148,155,162,170,177,185,192,200,207,215,223,231, %U A229170 239,246,254,262,270,278,287,295,303,311,319,328,336,345,353,361,370,378,387,396,404,413,422,430,439,448,457,465,474 %N A229170 Define a sequence of real numbers by b(1)=2, b(n+1) = b(n) + log_2(b(n)); a(n) = ceiling( b(n) ). %H A229170 <a href="/index/Coi#Colombian">Index entries for Colombian or self numbers and related sequences</a> %e A229170 Comment from _N. J. A. Sloane_, Jun 07 2023: (Start) %e A229170 b(1) to b(4) are: %e A229170 [2, 3, 3+ln(3)/ln(2), 3+ln(3)/ln(2)+ln(3+ln(3)/ln(2))/ln(2)] %e A229170 b(1) to b(6) computed exactly and THEN converted to floating point are: %e A229170 2., 3., 4.58496250072115618145373894394, 6.78187243514238888864576363676, 9.54355608312733448665507868324, 12.7980830210090262451101642020. (End) %t A229170 Ceiling[NestList[N[#+Log2[#],1000]&,2,70]] (* Caution: this program uses an arbitrary cut-off at 1000 digits precision. - _N. J. A. Sloane_, Jun 07 2023 *) (* _Harvey P. Dale_, Jun 10 2023 *) %Y A229170 Cf. A229168, A229169, A155921, A229177. %K A229170 nonn %O A229170 1,1 %A A229170 _N. J. A. Sloane_, Sep 27 2013