Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A138466
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A138466 a(1)=1, then for n>=2 a(n)=n-floor((1/2)*a(a(n-1))). +0
1
1, 2, 2, 3, 4, 5, 5, 6, 7, 8, 8, 9, 10, 10, 11, 12, 13, 13, 14, 15, 16, 16, 17, 18, 19, 19, 20, 21, 21, 22, 23, 24, 24, 25, 26, 27, 27, 28, 29, 30, 30, 31, 32, 32, 33, 34, 35, 35, 36, 37, 38, 38, 39, 40, 40, 41, 42, 43, 43, 44, 45, 46, 46, 47, 48, 49, 49, 50, 51, 51, 52, 53, 54 (list; graph; listen)
OFFSET

1,2

FORMULA

For n>=1, a(n)=floor((sqrt(3)-1)*(n+1))

PROGRAM

(PARI) a(n)=floor((sqrt(3)-1)*(n+1))

CROSSREFS

Sequence in context: A064726 A057359 A076538 this_sequence A066530 A074183 A039960

Adjacent sequences: A138463 A138464 A138465 this_sequence A138467 A138468 A138469

KEYWORD

nonn

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), May 09 2008

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 November 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research