cp's OEIS Frontend

A215450 a(0)=0, a(1)=1, a(n) = a(n-1) + (Sum_{i=0..n-1} a(i)) mod n.

%I A215450 #12 Oct 29 2024 09:08:44
%S A215450 0,1,2,2,3,6,8,9,16,18,23,23,26,33,35,45,55,71,87,94,111,128,132,140,
%T A215450 152,172,186,198,210,224,244,249,264,294,325,341,344,360,393,425,434,
%U A215450 454,491,525,530,538,541,573,604,649,687,687,733,749,785,804,805,826,870,904
%N A215450 a(0)=0, a(1)=1, a(n) = a(n-1) + (Sum_{i=0..n-1} a(i)) mod n.
%F A215450 a(0)=0, a(1)=1, a(n) = a(n-1) + (a(0)+...+a(n-1)) mod n.
%o A215450 (Python)
%o A215450 a = [0]*77
%o A215450 a[1]=1
%o A215450 sum = a[0]+a[1]
%o A215450 for n in range(2,77):
%o A215450     print(a[n-2], end=', ')
%o A215450     a[n] = a[n-1] + sum % n
%o A215450     sum += a[n]
%Y A215450 Cf. A001519 is essentially equal to: a(0)=0, a(1)=1, a(n) = a(n-1) + Sum_{i=0..n-1} a(i).
%Y A215450 Cf. A182444.
%K A215450 nonn,easy
%O A215450 0,3
%A A215450 _Alex Ratushnyak_, Aug 10 2012