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!)
A079319 a(0) = 1; for n >= 1, a(n) = 4*a(n-1) - (2^n-1). 6
1, 3, 9, 29, 101, 373, 1429, 5589, 22101, 87893, 350549, 1400149, 5596501, 22377813, 89494869, 357946709, 1431721301, 5726754133, 22906754389, 91626493269, 366504924501, 1466017600853, 5864066209109, 23456256447829 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
LINKS
David Singmaster, On the cellular automaton of Ulam and Warburton, M500 Magazine of the Open University, #195 (December 2003), pp. 2-7. Also cached copy, included with permission.
FORMULA
a(n) = 2^n + (4^n-1)/3, n>=0.
a(n) = Sum_{i = 0..2^n - 1} A079314(i).
G.f.: (1-4x+2x^2)/((1-x)(1-2x)(1-4x)).
MATHEMATICA
A079319list[nmax_]:=LinearRecurrence[{7, -14, 8}, {1, 3, 9}, nmax+1]; A079319list[50] (* Paolo Xausa, Jul 30 2023 *)
PROG
(PARI) a(n)=if(n<0, 0, 2^n+(4^n-1)/3)
CROSSREFS
Records in A085194.
Sequence in context: A275014 A278404 A148941 * A112532 A148942 A109432
KEYWORD
nonn,easy
AUTHOR
N. J. A. Sloane, Feb 12 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 April 23 11:35 EDT 2024. Contains 371912 sequences. (Running on oeis4.)