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!)
A099138 a(n) = 6^(n-1)*J(n), where J(n) = A001045(n). 1
0, 1, 6, 108, 1080, 14256, 163296, 2006208, 23794560, 287214336, 3436494336, 41298398208, 495217981440, 5944792559616, 71324450021376, 855971764420608, 10271190988062720, 123257112966660096, 1479068428940476416 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
COMMENTS
In general k^(n-1)*J(n), where J(n) = A001045(n), is given by ((2*k)^n - (-k)^n)/(3*k) with g.f. x/((1+k*x)*(1-2*k*x)).
LINKS
FORMULA
G.f.: x/((1+6*x)*(1-12*x)).
a(n) = 6^(n-1)*Sum_{k=0..floor((n-1)/2)} binomial(n-k-1, k) * 2^k.
a(n) = (12^n - (-6)^n)/18.
a(n) = 6^(n-1)*A001045(n).
E.g.f.: (1/18)*(exp(12*x) - exp(-6*x)). - G. C. Greubel, Feb 18 2023
MATHEMATICA
LinearRecurrence[{6, 72}, {0, 1}, 40] (* G. C. Greubel, Feb 18 2023 *)
PROG
(Magma) [(12^n - (-6)^n)/18: n in [0..40]]; // G. C. Greubel, Feb 18 2023
(SageMath) [(12^n - (-6)^n)/18 for n in range(41)] # G. C. Greubel, Feb 18 2023
CROSSREFS
Sequence in context: A251667 A127213 A129003 * A230540 A295791 A361728
KEYWORD
easy,nonn
AUTHOR
Paul Barry, Sep 29 2004
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 April 19 23:40 EDT 2024. Contains 371798 sequences. (Running on oeis4.)