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 A319434 #40 Aug 15 2025 15:57:46 %S A319434 2,3,4,4,5,5,6,6,6,7,7,7,8,8,8,9,9,9,9,10,10,10,10,11,11,11,11,12,12, %T A319434 12,12,12,13,13,13,13,13,14,14,14,14,14,15,15,15,15,15,16,16,16,16,16, %U A319434 16,17,17,17,17,17,17,18,18,18,18,18,18,19,19,19,19,19 %N A319434 Take Golomb's sequence A001462 and shorten all the runs by 1. %C A319434 In other words, apply Lenormand's "raboter" transformation (see A318921) to A001462. %C A319434 Each value of n (n >= 2) appears exactly A001462(n)-1 times. %C A319434 There should be a simple formula for a(n), just as there is for Golomb's sequence. - _N. J. A. Sloane_, Nov 15 2018. After 10000 terms, a(n) seems to be growing like constant*n^0.640. - _N. J. A. Sloane_, Jun 04 2021 %H A319434 Rémy Sigrist, <a href="/A319434/b319434.txt">Table of n, a(n) for n = 1..10000</a> %H A319434 Brady Haran and N. J. A. Sloane, <a href="https://www.youtube.com/watch?v=R4OvBB9KHMA">Planing Sequences (Le Rabot)</a>, Numberphile video, June 2021. %H A319434 N. J. A. Sloane, Coordination Sequences, Planing Numbers, and Other Recent Sequences (II), Experimental Mathematics Seminar, Rutgers University, Jan 31 2019, <a href="https://vimeo.com/314786942">Part I</a>, <a href="https://vimeo.com/314790822">Part 2</a>, <a href="https://oeis.org/A320487/a320487.pdf">Slides.</a> (Mentions this sequence) %F A319434 a(n) = A001462(A001462(A001462(n) + n) + n). - _Alan Michael Gómez Calderón_, Aug 14 2025 %e A319434 Golomb's sequence begins 1, 2,2, 3,3, 4,4,4, 5,5,5, ... %e A319434 and we just shorten each run by one term, getting 2, 3, 4,4, 5,5, ... %Y A319434 Cf. A001462, A318921, A319951. %K A319434 nonn %O A319434 1,1 %A A319434 _N. J. A. Sloane_, Oct 02 2018 %E A319434 More terms from _Rémy Sigrist_, Oct 04 2018