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!)
A076502 a(1)=1, a(n)=n-a(n-a(n-a(n-1))). 0

%I #6 Mar 30 2012 18:39:10

%S 1,1,2,2,3,4,4,4,5,6,7,7,8,8,8,9,9,10,11,12,12,13,14,14,15,15,15,16,

%T 17,17,17,18,18,19,20,21,21,21,22,23,24,24,25,26,26,27,27,27,28,29,30,

%U 30,31,31,31,32,33,33,33,34,34,35,36,37,37,38,38,38,39,39,40,41,42,42,42

%N a(1)=1, a(n)=n-a(n-a(n-a(n-1))).

%C Conjecture : a(n) - c*n is bounded and a(n)=floor(c*n) + 0 + 1 or +2

%F a(n) is asymptotic to c*n with c=0.5698..is the positive root of x^3-x^2+2*x-1

%K nonn

%O 1,3

%A _Benoit Cloitre_, Nov 08 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 March 29 06:15 EDT 2024. Contains 371265 sequences. (Running on oeis4.)