login
This site is supported by donations 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
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, 17, 17, 17, 18, 18, 19, 20, 21, 21, 21, 22, 23, 24, 24, 25, 26, 26, 27, 27, 27, 28, 29, 30, 30, 31, 31, 31, 32, 33, 33, 33, 34, 34, 35, 36, 37, 37, 38, 38, 38, 39, 39, 40, 41, 42, 42, 42 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

COMMENTS

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

LINKS

Table of n, a(n) for n=1..75.

FORMULA

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

CROSSREFS

Sequence in context: A102548 A004001 A086841 * A076897 A316434 A066997

Adjacent sequences:  A076499 A076500 A076501 * A076503 A076504 A076505

KEYWORD

nonn

AUTHOR

Benoit Cloitre, Nov 08 2002

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 21 21:59 EDT 2019. Contains 325199 sequences. (Running on oeis4.)