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 A077146 #23 Jul 31 2022 13:17:17 %S A077146 23,19,173,14093,145,137,131,127,124,121,119,117,116453592, %T A077146 11416794012,1141,1132,1124,1116,1110,1104,1099,1094,1090,1086,1083, %U A077146 1079,1076,1073,1071,1068,1066,1064,1062,1060,1058,1057,1055,1053,1052,1051,1049,1048,1047 %N A077146 a(n) = floor((concatenation of next (n+1) numbers) / (concatenation of next n numbers)). %C A077146 The numerator numbers to be concatenated are taken from 2,3,4,... and the denominator numbers from 1,2,3,... - _Lars Blomberg_, Mar 18 2012 %H A077146 Michael S. Branicky, <a href="/A077146/b077146.txt">Table of n, a(n) for n = 1..1413</a> %F A077146 a(n) = floor(A053067(n+1)/A053067(n)). - _Michel Marcus_, Jul 31 2022 %e A077146 a(1) = floor(23/1) = 23. %e A077146 a(2) = floor(456/23) = 19. %e A077146 a(3) = floor(78910/456) = 173. %o A077146 (Python) %o A077146 def b(n): return int("".join(map(str, range((n-1)*n//2+1, n*(n+1)//2+1)))) %o A077146 def a(n): return b(n+1)//b(n) %o A077146 print([a(n) for n in range(1, 44)]) # _Michael S. Branicky_, Jul 31 2022 %Y A077146 Cf. A053067. %K A077146 base,nonn %O A077146 1,1 %A A077146 _Amarnath Murthy_, Oct 30 2002 %E A077146 a(7)-a(36) from _Lars Blomberg_, Mar 18 2012 %E A077146 a(37) and beyond from _Michael S. Branicky_, Jul 31 2022