Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A088462
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A088462 a(1)=1, a(n)=ceiling((n-a(a(n-1)))/2). +0
2
1, 1, 1, 2, 2, 3, 3, 4, 4, 4, 5, 5, 6, 6, 6, 7, 7, 8, 8, 8, 9, 9, 10, 10, 11, 11, 11, 12, 12, 13, 13, 13, 14, 14, 15, 15, 16, 16, 16, 17, 17, 18, 18, 18, 19, 19, 20, 20, 21, 21, 21, 22, 22, 23, 23, 23, 24, 24, 25, 25, 25, 26, 26, 27, 27, 28, 28, 28, 29, 29, 30, 30, 30, 31, 31, 32, 32 (list; graph; listen)
OFFSET

1,4

COMMENT

Partial sums of A004641. [From Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Dec 05 2009]

LINKS

R. Zumkeller, Table of n, a(n) for n = 1..10000 [From Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Dec 05 2009]

FORMULA

a(n)=floor((sqrt(2)-1)*n+1/sqrt(2))

CROSSREFS

Cf. A005206.

Sequence in context: A060021 A000006 A061017 this_sequence A093337 A120397 A104305

Adjacent sequences: A088459 A088460 A088461 this_sequence A088463 A088464 A088465

KEYWORD

nonn,new

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), Nov 12 2003

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 15 00:47 EST 2009. Contains 170825 sequences.


AT&T Labs Research