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!)
A283474 a(0) = 0, a(1) = 1, for n > 1, a(n) = a(n-1) + a(n-A002487(n)). 4

%I #6 Mar 23 2017 20:32:05

%S 0,1,2,3,6,8,14,20,40,48,68,82,150,190,272,354,708,858,1130,1280,2138,

%T 2328,3186,3894,7080,8210,10538,11818,20028,23214,33752,44290,88580,

%U 100398,123612,134150,222730,233268,277558,300772,534040,567792,691404,725156,1025928,1126326,1427098,1704656,3131754,3665794

%N a(0) = 0, a(1) = 1, for n > 1, a(n) = a(n-1) + a(n-A002487(n)).

%H Antti Karttunen, <a href="/A283474/b283474.txt">Table of n, a(n) for n = 0..1024</a>

%F a(0) = 0, a(1) = 1, for n > 1, a(n) = a(n-1) + a(A284013(n)).

%o (Scheme, with memoization-macro definec)

%o (definec (A283474 n) (if (<= n 1) n (+ (A283474 (- n 1)) (A283474 (- n (A002487 n))))))

%Y Cf. A000045, A002487, A078510, A284007, A284013.

%Y Cf. A283479 (first differences).

%K nonn

%O 0,3

%A _Antti Karttunen_, Mar 23 2017

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 September 16 06:47 EDT 2024. Contains 375959 sequences. (Running on oeis4.)