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 A138095 #16 Aug 09 2022 10:58:33 %S A138095 1,3,3,4,6,7,7,10,10,10,12,14,14,15,15,17,18,19,20,23,22,22,25,24,25, %T A138095 27,29,30,32,32,31,32,34,35,39,36,38,39,41,42,43,43,45,46,46,46,48,52, %U A138095 51,53,51,52,55,55,56,59,57,60,63,62,62,64,63,65,66,68,69,70,72,71 %N A138095 Limiting sequence when we start with positive integers (A000027) and at step n >= 1 add: to the term at position n + 1*a(n) the value 1, to the term at position n + 2*a(n) the value 1, ..., to the term at position n + n*a(n) the value 1. %e A138095 n | 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 %e A138095 --------+----------------------------------------------------------- %e A138095 Step 1 | 3 %e A138095 Step 2 | 6 9 %e A138095 Step 3 | 7 10 13 %e A138095 Step 4 | 10 14 17 21 %e A138095 Step 5 | 12 18 %e A138095 Step 6 | 14 22 %e A138095 Step 7 | 15 %e A138095 Step 8 | 19 %e A138095 Step 9 | 20 %e A138095 Step 10 | 23 %e A138095 --------+----------------------------------------------------------- %e A138095 a(n) | 1 3 3 4 6 7 7 10 10 10 12 14 14 15 15 17 18 19 20 23 %o A138095 (PARI) lista(nn) = my(va = [1..nn]); for (n=1, nn, for (k=1, n, my(j = n+k*va[n]); if (j <= #va, va[j]++); )); va; \\ _Michel Marcus_, Aug 09 2022 %Y A138095 Cf. A000027, A136119, A137319, A137417, A137418, A136259, A136272, A137292, A136120, A137832, A137838, A137894, A137898, A137901, A137902, A137903. %K A138095 easy,nonn %O A138095 1,2 %A A138095 _Ctibor O. Zizka_, May 03 2008 %E A138095 Corrected and extended by _Michel Marcus_, Aug 09 2022