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!)
A082472 a(1) = 1, a(n) = Sum_{k=1..n-1} a(k)*2^k. 1
1, 2, 10, 90, 1530, 50490, 3281850, 423358650, 108803173050, 55816027774650, 57211428469016250, 117226216933014296250, 480275810774559571736250, 3934899717675966571235096250, 64473331874120712269687052056250 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
FORMULA
a(n+1) = (2^n+1)*a(n) for n>=2.
a(n) is asymptotic to c*2^(n*(n-1)/2) where c = Product_{k>=1} (1+1/(2*2^k)) = 1.5894873526.....
c = 2*A079555/3. - Vaclav Kotesovec, Jun 05 2020
G.f. A(x) satisfies: A(x) = x * (1 + A(2*x) / (1 - x)). - Ilya Gutkovskiy, Jun 04 2020
MATHEMATICA
Join[{1}, RecurrenceTable[{a[1]==2, a[n]==(1+2^n) a[-1+n]}, a[n], {n, 15}]] (* Harvey P. Dale, May 11 2011 *)
PROG
(Sage)
from ore_algebra import *
R.<x> = QQ['x']; A.<Qx> = OreAlgebra(R, 'Qx', q=2)
print((Qx - x - 1).to_list([0, 1, 2], 10)) # Ralf Stephan, Apr 24 2014
CROSSREFS
Sequence in context: A320962 A067550 A086587 * A095937 A277380 A108528
KEYWORD
nonn
AUTHOR
Benoit Cloitre, Apr 27 2003
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 March 28 05:39 EDT 2024. Contains 371235 sequences. (Running on oeis4.)