Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A076502
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A076502 a(1)=1, a(n)=n-a(n-a(n-a(n-1))). +0
1
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; listen)
OFFSET

1,3

COMMENT

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

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 this_sequence A076897 A078881 A066997

Adjacent sequences: A076499 A076500 A076501 this_sequence A076503 A076504 A076505

KEYWORD

nonn

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), Nov 08 2002

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 20 16:54 EST 2009. Contains 171081 sequences.


AT&T Labs Research