This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A284006 a(n) = a(a(n-A001511(n))) + a(n-a(n-A001511(n))) with a(1) = a(2) = 1, where A001511(n) = 1 + exponent of the highest power of 2 dividing n. 2
 1, 1, 2, 3, 3, 4, 5, 5, 6, 6, 7, 8, 8, 9, 10, 11, 11, 12, 13, 13, 13, 14, 15, 15, 16, 17, 17, 19, 19, 20, 20, 21, 21, 21, 22, 23, 24, 25, 25, 26, 27, 28, 29, 28, 30, 31, 31, 32, 32, 33, 33, 34, 34, 34, 34, 35, 36, 37, 38, 38, 40, 40, 41, 42, 43, 43, 44, 45, 45, 46, 47, 47, 48, 48, 49, 51, 50, 50 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 LINKS Antti Karttunen, Table of n, a(n) for n = 1..10001 FORMULA a(1) = a(2) = 1, for n > 2, a(n) = a(a(A093049(n))) + a(n-a(A093049(n))). PROG (Scheme, with memoization-macro definec) (definec (A284006 n) (if (<= n 2) 1 (+ (A284006 (A284006 (- n (A001511 n)))) (A284006 (- n (A284006 (- n (A001511 n)))))))) CROSSREFS Cf. A001511, A004001, A093049, A284000, A284007. Sequence in context: A039729 A074065 A024811 * A131138 A284724 A189579 Adjacent sequences:  A284003 A284004 A284005 * A284007 A284008 A284009 KEYWORD nonn AUTHOR Antti Karttunen, Mar 23 2017 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
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified March 26 05:43 EDT 2019. Contains 321481 sequences. (Running on oeis4.)