cp's OEIS Frontend

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.

A376023 a(1) = 1, for n >= 2, a(n) = abs(a(n - 1) + A376022(n)).

This page as a plain text file.
%I A376023 #18 Nov 28 2024 20:33:46
%S A376023 1,0,3,10,17,19,19,18,15,9,6,65,74,78,80,80,79,76,71,63,49,9,62,77,85,
%T A376023 90,93,94,93,90,85,78,68,52,21,204,247,266,277,284,288,290,290,289,
%U A376023 286,281,274,264,250,229,192,62,150,182,201,214,223,229,233,235,235,234,231
%N A376023 a(1) = 1, for n >= 2, a(n) = abs(a(n - 1) + A376022(n)).
%H A376023 John Tyler Rascoe, <a href="/A376023/b376023.txt">Table of n, a(n) for n = 1..10000</a>
%e A376023 a(1) = 1.
%e A376023 a(2) = abs(a(1) + A376022(2)) = abs(1+(-1)) = 0.
%e A376023 a(3) = abs(0 + A376022(3)) = abs(0 + (-3)) = 3.
%e A376023 a(4) = abs(3 + A376022(4)) = abs(3 + (-13)) = 10.
%e A376023 and so on.
%t A376023 s[1] = 1; s[n_] := s[n] = -1 + Floor[n*s[n-1]/(n + s[n-1])]; a[1] = 1; a[n_] := a[n] = Abs[a[n-1] + s[n]]; Array[a, 100] (* _Amiram Eldar_, Sep 06 2024 *)
%o A376023 (Python)
%o A376023 from itertools import count, islice
%o A376023 def a_gen():
%o A376023     a,c = 1,1
%o A376023     for n in count(2):
%o A376023         yield c
%o A376023         b = -1+(n*a)//(n+a)
%o A376023         d = abs(c + b)
%o A376023         a = b
%o A376023         c = d
%o A376023 A376023_list = list(islice(a_gen(), 100)) # _John Tyler Rascoe_, Sep 17 2024
%o A376023 (PARI) lista(nn)= my(a=-2, b=0); vector(nn, n, a=floor(n*a/(n+a))-1; b=abs(a+b)); \\ _Ruud H.G. van Tol_, Nov 28 2024
%Y A376023 Cf. A376022.
%K A376023 nonn,look
%O A376023 1,3
%A A376023 _Ctibor O. Zizka_, Sep 06 2024