This site is supported by donations to The OEIS Foundation.

"Email this user" was broken Aug 14 to 9am Aug 16. If you sent someone a message in this period, please send it again.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A007599 a(n+1) = a(n)+a(a(a(..(n-1)..))), depth [ n/2 ]. (Formerly M0455) 3
 1, 0, 1, 1, 1, 1, 2, 3, 4, 5, 5, 5, 6, 7, 8, 9, 9, 9, 10, 11, 11, 11, 12, 13, 14, 15, 15, 15, 16, 17, 17, 17, 18, 19, 19, 19, 20, 21, 21, 21, 22, 23, 24, 25, 25, 25, 26, 27, 27, 27, 28, 29, 29, 29, 30, 31, 31, 31, 32, 33, 33, 33, 34, 35, 35, 35, 36, 37, 37, 37, 38, 39, 39, 39, 40 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,7 REFERENCES N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence). LINKS T. D. Noe, Table of n, a(n) for n = 0..1000 MATHEMATICA a[n_Integer] := a[n] = (a[n - 1] + Nest[a, n - 2, Floor[n/2] ] ); a[0] = 1; a[1] = 0; Table[ a[n], {n, 0, 75} ] PROG (Haskell) a007599 n = a007599_list !! n a007599_list = 1 : f 1 1  where    f x m = y : f y (m + 1) where      y = x + (iterate a007599 (m-2)) !! (m `div` 2) -- Reinhard Zumkeller, Jan 05 2012 CROSSREFS Sequence in context: A063273 A200262 A270432 * A279317 A154940 A133344 Adjacent sequences:  A007596 A007597 A007598 * A007600 A007601 A007602 KEYWORD nonn,nice,easy AUTHOR 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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.