login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A333132 a(n) = n for n <= 3; thereafter a(n) = 2^(a(n-1)-1) + a(n-1). 0
1, 2, 3, 7, 71, 1180591620717411303495 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
The next term is too large to include.
a(n) = number of compositions of a(1) + number of compositions of a(2) + ... + number of compositions of a(n-1) for n > 2.
LINKS
FORMULA
a(n) = n for n <= 2; thereafter a(n) = Sum_{k=1..n-1} 2^(a(k)-1).
EXAMPLE
a(5) = 71, 71 in base 2 (reverse order of digits) = 1110001.
||| |
123 7
MATHEMATICA
a[n_] := a[n] = If[n <= 3, n, 2^(a[n - 1] - 1) + a[n - 1]]; Table[a[n], {n, 1, 6}]
CROSSREFS
Sequence in context: A088542 A075840 A096225 * A035094 A084729 A101117
KEYWORD
nonn
AUTHOR
Ilya Gutkovskiy, Mar 08 2020
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 11 12:18 EDT 2024. Contains 372409 sequences. (Running on oeis4.)