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!)
A132915 a(0)=0; a(1)=1; a(n) = Sum_{k=1..[sqrt(n)]} a(n-k) for n>=2. 1

%I #6 Aug 10 2018 16:14:08

%S 0,1,1,1,2,3,5,8,13,26,47,86,159,292,537,988,1976,3793,7294,14051,

%T 27114,52252,100711,194128,374205,748410,1469706,2887160,5673609,

%U 11153090,21931975,43115540,84761374,166635588,327597567,644042044,1288084088

%N a(0)=0; a(1)=1; a(n) = Sum_{k=1..[sqrt(n)]} a(n-k) for n>=2.

%C Lim n->infinity {a(n+1)/a(n)} = 2. Contrast with Fibonacci sequence. Also a(n+1)/a(n) = 2 iff n+1 is square.

%F a(n) = sum a(n-k), k= 1 ... [sqrt(n)] for n>=2; a(0)=0; a(1)=1.

%e a(9) = a(6) + a(7) + a(8) = 5 + 8 + 13 = 26.

%Y Cf. A132916.

%K nonn

%O 0,5

%A _Rick L. Shepherd_, Sep 04 2007

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 18 04:56 EDT 2024. Contains 371767 sequences. (Running on oeis4.)