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 A022796 #30 Dec 31 2024 06:30:56
%S A022796 1,2,3,4,6,8,10,13,16,19,23,27,31,36,41,46,52,58,64,71,78,85,93,101,
%T A022796 109,117,126,135,144,154,164,174,185,196,207,219,231,243,256,269,282,
%U A022796 296,310,324,339,354,369,384,400,416,432,449,466,483,501,519
%N A022796 Place where n-th 1 occurs in A023134.
%C A022796 This is column 1 of the transposable interspersion A283944.
%H A022796 Clark Kimberling, <a href="/A022796/b022796.txt">Table of n, a(n) for n = 1..1001</a>
%F A022796 a(n) = n + Sum_{k=1..n} floor((n-k)/Pi).
%F A022796 a(n) <= floor(binomial(n, 2)/Pi) + n. - _David A. Corneth_, Mar 26 2017
%t A022796 Table[n + Sum[Floor[(n - k)/Pi], {k, 1, n}], {n, 1, 100}]
%o A022796 (PARI) for(n=1, 100, print1(n + sum(k=1, n, floor((n - k)/Pi)),", ")); \\ _Indranil Ghosh_, Mar 26 2017
%o A022796 (Python)
%o A022796 import math
%o A022796 from mpmath import *
%o A022796 mp.dps = 100
%o A022796 print([n + sum([int(math.floor((n - k)/pi)) for k in range(1, n + 1)]) for n in range(1, 101)]) # _Indranil Ghosh_, May 28 2019
%Y A022796 Cf. A000796, A023134, A283944.
%K A022796 nonn
%O A022796 1,2
%A A022796 _Clark Kimberling_
%E A022796 Updated by _Clark Kimberling_, Mar 27 2017
%E A022796 Offset changed to 1 by _Sean A. Irvine_, May 21 2019