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!)
A076678 a(0)=a(1)=1 a(n)=floor(sqrt(a(n-1)))+a(n-2). 4

%I #7 Apr 28 2014 15:26:57

%S 1,1,2,2,3,3,4,5,6,7,8,9,11,12,14,15,17,19,21,23,25,28,30,33,35,38,41,

%T 44,47,50,54,57,61,64,69,72,77,80,85,89,94,98,103,108,113,118,123,129,

%U 134,140,145,152,157,164,169,177,182,190,195,203,209,217,223,231,238

%N a(0)=a(1)=1 a(n)=floor(sqrt(a(n-1)))+a(n-2).

%F a(n) is asymptotic to n^2/16

%t RecurrenceTable[{a[0]==a[1]==1,a[n]==Floor[Sqrt[a[n-1]]]+a[n-2]},a,{n,70}] (* _Harvey P. Dale_, Apr 28 2014 *)

%K nonn

%O 0,3

%A _Benoit Cloitre_, Oct 25 2002

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 14 15:15 EDT 2024. Contains 375921 sequences. (Running on oeis4.)