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

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A119614 a(1)=1. a(2^m +k) = a(2^m + 1 - k)*a(k) + 1, where 1 <= k <= 2^m, m>=0. 1
1, 2, 3, 3, 4, 7, 7, 4, 5, 15, 22, 13, 13, 22, 15, 5, 6, 31, 67, 40, 53, 155, 106, 21, 21, 106, 155, 53, 40, 67, 31, 6, 7, 63, 202, 121, 213, 1086, 743, 85, 106, 1591, 3411, 690, 521, 1475, 466, 31, 31, 466, 1475, 521, 690, 3411, 1591, 106, 85, 743, 1086, 213, 121, 202 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Table of n, a(n) for n=1..62.

MAPLE

A119614 := proc (mmax) local a, m, k, an; a := [1] ; for m from 0 to mmax do for k from 1 to 2^m do an := a[2^m+1-k]*a[k]+1 ; a := [op(a), an] ; od ; od ; RETURN(a) ; end: an := A119614(6) : for i from 1 to nops(an) do printf("%d, ", an[i]) ; od ; # R. J. Mathar, Aug 06 2006

CROSSREFS

Sequence in context: A269098 A119795 A207618 * A260167 A035540 A114863

Adjacent sequences:  A119611 A119612 A119613 * A119615 A119616 A119617

KEYWORD

easy,nonn

AUTHOR

Leroy Quet, Jun 05 2006

EXTENSIONS

More terms from R. J. Mathar, Aug 06 2006

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 7 22:29 EST 2019. Contains 329850 sequences. (Running on oeis4.)