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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A151930 First differences of A001316. 2
1, 0, 2, -2, 2, 0, 4, -6, 2, 0, 4, -4, 4, 0, 8, -14, 2, 0, 4, -4, 4, 0, 8, -12, 4, 0, 8, -8, 8, 0, 16, -30, 2, 0, 4, -4, 4, 0, 8, -12, 4, 0, 8, -8, 8, 0, 16, -28, 4, 0, 8, -8, 8, 0, 16, -24, 8, 0, 16, -16, 16, 0, 32, -62, 2, 0, 4, -4, 4, 0, 8, -12, 4, 0, 8, -8, 8, 0, 16, -28, 4, 0, 8, -8, 8, 0, 16, -24, 8, 0, 16, -16, 16, 0, 32 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

COMMENTS

Net increase in number of ON cells at generation n of 1-D CA using Rule 90.

LINKS

Table of n, a(n) for n=0..94.

Index entries for sequences related to cellular automata

FORMULA

a((2*n+1)*2^p-1) = (2-2^p) * A001316(n), p >= 0 and n >=0. - Johannes W. Meijer, Jan 25 2013

G.f.: -1/x + ((1 - x)/x)*Product_{k>=0} (1 + 2*x^(2^k)). - Ilya Gutkovskiy, Feb 28 2017

MAPLE

nmax := 94: A001316 := n -> if n<=-1 then 0 else 2^add(i, i=convert(n, base, 2)) fi: for p from 0 to ceil(log[2](nmax))+1 do for n from 0 to nmax/(p+2)+1 do a((2*n+1)*2^p-1) := (2-2^p) * A001316(n) od: od: seq(a(n), n=0..nmax); # Johannes W. Meijer, Jan 25 2013

CROSSREFS

Cf. A001316, A220466.

Sequence in context: A125938 A215461 A158851 * A084203 A073358 A124342

Adjacent sequences:  A151927 A151928 A151929 * A151931 A151932 A151933

KEYWORD

sign

AUTHOR

N. J. A. Sloane, Aug 10 2009

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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified February 21 07:18 EST 2018. Contains 299390 sequences. (Running on oeis4.)