login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A088462 a(1)=1, a(n)=ceiling((n-a(a(n-1)))/2). 4
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; refs; listen; history; internal format)
OFFSET

1,4

COMMENTS

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

This sequence generates A004641; see comment at A004641.  [From Clark Kimberling, May 25 2011]

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 * A189574 A093337 A176044

Adjacent sequences:  A088459 A088460 A088461 * A088463 A088464 A088465

KEYWORD

nonn

AUTHOR

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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 10:28 EST 2012. Contains 205763 sequences.