login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A057176 a(0) = 1; for n >= 1, a(n) = Sum_{j=0..a(n-1) mod n} a(j). 7

%I #21 Sep 04 2017 23:28:16

%S 1,1,2,4,1,2,4,9,2,4,9,30,15,4,9,30,97,84,84,26,15,127,308,30,15,127,

%T 898,24,913,97,24,913,308,69,2,4,9,30,2996,4217,308,560,97,69,1040,11,

%U 69,868,9,30,2996,7327,14566,13618,39,11544,26,1938,913

%N a(0) = 1; for n >= 1, a(n) = Sum_{j=0..a(n-1) mod n} a(j).

%H Michael De Vlieger, <a href="/A057176/b057176.txt">Table of n, a(n) for n = 0..10000</a>

%F a(0) = 1; for n >= 1, a(n) = Sum_{j=0..a(n-1) mod n} a(j).

%t a[m_] := Sum[a[j], {j, 0, Mod[a[m-1], m]}]; vv={1}; Do[a[n]=If[n==0, 1, b]; v=a[n+1]; vv=Insert[vv, v, -1]; b=v, {n, 0, 50}]; vv

%K nonn

%O 0,3

%A _Leroy Quet_, Aug 03 2003

%E More terms from _Farideh Firoozbakht_, Aug 03 2003

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 16 17:08 EDT 2024. Contains 371749 sequences. (Running on oeis4.)