A001316 -id:A001316 - cp's OEIS frontend

A080100 a(n) = 2^(number of 0's in binary representation of n).

1, 1, 2, 1, 4, 2, 2, 1, 8, 4, 4, 2, 4, 2, 2, 1, 16, 8, 8, 4, 8, 4, 4, 2, 8, 4, 4, 2, 4, 2, 2, 1, 32, 16, 16, 8, 16, 8, 8, 4, 16, 8, 8, 4, 8, 4, 4, 2, 16, 8, 8, 4, 8, 4, 4, 2, 8, 4, 4, 2, 4, 2, 2, 1, 64, 32, 32, 16, 32, 16, 16, 8, 32, 16, 16, 8, 16, 8, 8, 4, 32, 16, 16, 8, 16, 8, 8, 4, 16, 8, 8, 4, 8, 4

Offset: 0

Reinhard Zumkeller, Jan 28 2003

Number of numbers k, 0<=k<=n, such that (k AND n) = 0 (bitwise logical AND): a(n) = #{k : T(n,k)=n, 0<=k<=n}, where T is defined as in A080099.

Same parity as the Catalan numbers (A000108). - Paul D. Hanna, Nov 14 2012

Reinhard Zumkeller, Table of n, a(n) for n = 0..8191
George Beck and Karl Dilcher, A Matrix Related to Stern Polynomials and the Prouhet-Thue-Morse Sequence, arXiv:2106.10400 [math.CO], 2021.
Ralf Stephan, Divide-and-conquer generating functions. I. Elementary sequences, arXiv:math/0307027 [math.CO], 2003.

Cf. A001316.
Cf. A002487.
This is Guy Steele's sequence GS(5, 3) (see A135416).
Cf. A048896.
Cf. A023416, A080791.

import Data.List (transpose)
a080100 n = a080100_list !! n
a080100_list =  1 : zs where
   zs =  1 : (concat $ transpose [map (* 2) zs, zs])
-- Reinhard Zumkeller, Aug 27 2014, Mar 07 2011

a:= n-> 2^add(1-i, i=Bits[Split](n)):
seq(a(n), n=0..93);  # Alois P. Heinz, Aug 18 2025

f[n_] := 2^DigitCount[n, 2, 0]; f[0] = 1; Array[f, 94, 0] (* Robert G. Wilson v *)

PARI
```
a(n)=if(n<1,n==0,(2-n%2)*a(n\2))
```

a(n)=local(A,m); if(n<0,0,m=1; A=1+O(x); while(m<=n,m*=2; A=subst(A,x,x^2)*(2+x)-1); polcoeff(A,n))

def A080100(n): return 1<Chai Wah Wu, Aug 18 2025

G.f. satisfies: F(x^2) = (1+F(x))/(x+2). - Ralf Stephan, Jun 28 2003
a(2n) = 2a(n), n>0. a(2n+1) = a(n). - Ralf Stephan, Apr 29 2003
a(n) = 2^A080791(n). a(n)=2^A023416(n), n>0.
a(n) = sum(k=0, n, C(n+k, k) mod 2). - Benoit Cloitre, Mar 06 2004
a(n) = sum(k=0, n, C(2n-k, n) mod 2). - Paul Barry, Dec 13 2004
G.f. satisfies: A(x) = Sum_{n>=0} [A(x)^n (mod 2)]*x^n, where A(x)^n (mod 2) reduces all coefficients modulo 2 to {0,1}. - Paul D. Hanna, Nov 14 2012

Keyword base added by Rémy Sigrist, Jan 18 2018

A160464 The Eta triangle.

Original entry on oeis.org

-1, -11, 2, -114, 29, -2, -3963, 1156, -122, 4, -104745, 32863, -4206, 222, -4, -3926745, 1287813, -184279, 12198, -366, 4, -198491580, 67029582, -10317484, 781981, -30132, 562, -4

Offset: 2

Johannes W. Meijer, May 24 2009

The ES1 matrix coefficients are defined by ES1[2*m-1,n] = 2^(2*m-1) * int(y^(2*m-1)/(cosh(y))^(2*n),y=0..infinity)/(2*m-1)! for m = 1, 2, 3, .. and n = 1, 2, 3 .. .
This definition leads to ES1[2*m-1,n=1] = 2*eta(2*m-1) and the recurrence relation ES1[2*m-1,n] = ((2*n-2)/(2*n-1))*(ES1[2*m-1,n-1] - ES1[2*m-3,n-1]/(n-1)^2) which we used to extend our definition of the ES1 matrix coefficients to m = 0, -1, -2, .. . We discovered that ES1[ -1,n] = 0.5 for n = 1, 2, .. . As usual eta(m) = (1-2^(1-m))*zeta(m) with eta(m) the Dirichlet eta function and zeta(m) the Riemann zeta function.
The coefficients in the columns of the ES1 matrix, for m = 1, 2, 3, .. , and n = 2, 3, 4 .. , can be generated with the polynomials GF(z,n) for which we found the following general expression GF(z;n) = ((-1)^(n-1)*r(n)*CFN1(z,n)*GF(z;n=1) + ETA(z,n))/p(n).
The CFN1(z,n) polynomials depend on the central factorial numbers A008955.
The ETA(z,n) are the Eta polynomials which lead to the Eta triangle.
The zero patterns of the Eta polynomials resemble a UFO. These patterns resemble those of the Zeta, Beta and Lambda polynomials, see A160474, A160480 and A160487.
The first Maple algorithm generates the coefficients of the Eta triangle. The second Maple algorithm generates the ES1[2*m-1,n] coefficients for m= 0, -1, -2, -3, .. .
The M(n) sequence, see the second Maple algorithm, leads to Gould's sequence A001316 and a sequence that resembles the denominators of the Taylor series for tan(x), A156769(n).
Some of our results are conjectures based on numerical evidence, see especially A160466.

			The first few rows of the triangle ETA(n,m) with n=2,3,.. and m=1,2,... are
  [ -1]
  [ -11, 2]
  [ -114, 29, -2]
  [ -3963, 1156, -122, 4].
The first few ETA(z,n) polynomials are
  ETA(z,n=2) = -1;
  ETA(z,n=3) = -11+2*z^2;
  ETA(z,n=4) = -114 + 29*z^2 - 2*z^4.
The first few CFN1(z,n) polynomials are
  CFN1(z,n=2) = (z^2-1);
  CFN1(z,n=3) = (z^4 - 5*z^2 + 4);
  CFN1(z,n=4) = (z^6 - 14*z^4 + 49*z^2 - 36).
The first few generating functions GF(z;n) are:
  GF(z;n=2) = ((-1)*2*(z^2 - 1)*GF(z;n=1) + (- 1))/3;
  GF(z;n=3) = (4*(z^4 - 5*z^2+4) *GF(z;n=1) + (-11 + 2*z^2))/30;
  GF(z;n=4) = ((-1)*4*(z^6 - 14*z^4 + 49*z^2 - 36)*GF(z;n=1) + (-114 + 29*z^2 - 2*z^4))/315.

Mohammad K. Azarian, Problem 1218, Pi Mu Epsilon Journal, Vol. 13, No. 2, Spring 2010, p. 116. Solution published in Vol. 13, No. 3, Fall 2010, pp. 183-185.

M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards, Applied Math. Series 55, Tenth Printing, 1972, Chapter 23, pp. 811-812.
Johannes W. Meijer, The zeros of the Eta, Zeta, Beta and Lambda polynomials, jpg and pdf, Mar 03 2013.
J. W. Meijer and N.H.G. Baken, The Exponential Integral Distribution, Statistics and Probability Letters, Volume 5, No.3, April 1987. pp 209-211.
Eric. W. Weisstein, Dirichlet Eta Function, Wolfram MathWorld.

The r(n) sequence equals A062383 (n>=1).
The p(n) sequence equals A160473(n) (n>=2).
The GCS(n) sequence equals the Geometric Connell sequence A049039(n).
The M(n-1) sequence equals A001316(n-1)/A156769(n) (n>=1).
The q(n) sequence leads to A081729 and the 'gossip sequence' A007456.
The first right hand column equals A053644 (n>=1).
The first left hand column equals A160465.
The row sums equal A160466.
The CFN1(z, n) and the cfn1(n, k) lead to A008955.
Cf. A094665 and A160468.
Cf. the Zeta, Beta and Lambda triangles A160474, A160480 and A160487.
Cf. A162440 (EG1 matrix).

nmax:=8; c(2 ):= -1/3: for n from 3 to nmax do c(n) := (2*n-2)*c(n-1)/(2*n-1)-1/((n-1)*(2*n-1)) end do: for n from 2 to nmax do GCS(n-1) := ln(1/(2^(-(2*(n-1)-1-floor(ln(n-1)/ ln(2))))))/ln(2); p(n) := 2^(-GCS(n-1))*(2*n-1)!; ETA(n, 1) := p(n)*c(n); ETA(n, n) := 0 end do: mmax:=nmax: for m from 2 to mmax do for n from m+1 to nmax do q(n) := (1+(-1)^(n-3)*(floor(ln(n-1)/ln(2)) - floor(ln(n-2)/ln(2)))): ETA(n, m) := q(n)*((-1)*ETA(n-1, m-1)+(n-1)^2*ETA(n-1, m)) end do end do: seq(seq(ETA(n,m), m=1..n-1), n=2..nmax);
# End first program.
nmax1:=20; m:=1; ES1row:=1-2*m; with (combinat): cfn1 := proc(n, k): sum((-1)^j*stirling1(n+1, n+1-k+j) * stirling1(n+1, n+1-k-j), j=-k..k) end proc: mmax1:=nmax1: for m1 from 1 to mmax1 do M(m1-1) := 2^(2*m1-2)/((2*m1-1)!); ES1[-2*m1+1,1] := 2*(1-2^(1-(1-2*m1)))*(-bernoulli(2*m1)/(2*m1)) od: for n from 2 to nmax1 do for m1 from 1 to mmax1-n+1 do ES1[1-2*m1, n] := (-1)^(n-1)*M(n-1)*sum((-1)^(k+1)*cfn1(n-1,k-1)* ES1[2*k-2*n-2*m1+1, 1], k=1..n) od: od: seq(ES1[1-2*m, n], n=1..nmax1-m+1);
# End second program.

We discovered an interesting relation between the Eta triangle coefficients ETA(n,m) = q(n)*((-1)*ETA(n-1,m-1)+(n-1)^2*ETA(n-1,m)), for n = 3, 4, ... and m = 2, 3, ... , with
q(n) = 1 + (-1)^(n-3)*(floor(log(n-1)/log(2)) - floor(log(n-2)/log(2))) for n = 3, 4, ....
See A160465 for ETA(n,m=1) and furthermore ETA(n,n) = 0 for n = 2, 3, ....
The generating functions GF(z;n) of the coefficients in the matrix columns are defined by
GF(z;n) = sum_{m>=1} ES1[2*m-1,n] * z^(2*m-2), with n = 1, 2, 3, .... This leads to
GF(z;n=1) = (2*log(2) - Psi(z) - Psi(-z) + Psi(1/2*z) + Psi(-1/2*z)); Psi(z) is the digamma-function.
GF(z;n) = ((2*n-2)/(2*n-1)-2*z^2/((n-1)*(2*n-1)))*GF(z;n-1)-1/((n-1)*(2*n-1)).
We found for GF(z;n), for n = 2, 3, ..., the following general expression:
GF(z;n) = ((-1)^(n-1)*r(n)*CFN1(z,n)*GF(z;n=1) + ETA(z,n) )/p(n) with
r(n) = 2^floor(log(n-1)/log(2)+1) and
p(n) = 2^(-GCS(n))*(2*n-1)! with
GCS(n) = log(1/(2^(-(2*(n-1)-1-floor(log(n-1)/ log(2))))))/log(2).

A117940 a(0)=1, thereafter a(3n) = a(3n+1)/3 = a(n), a(3n+2)=0.

Original entry on oeis.org

1, 3, 0, 3, 9, 0, 0, 0, 0, 3, 9, 0, 9, 27, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 9, 0, 9, 27, 0, 0, 0, 0, 9, 27, 0, 27, 81, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 9, 0, 9, 27, 0, 0, 0, 0, 9, 27, 0, 27, 81, 0, 0, 0, 0, 0, 0

Offset: 0

Paul Barry, Apr 05 2006

a(n) = a(3n)/a(0) = a(3n+1)/a(1). a(n) mod 2 = A039966(n). Row sums of A117939.

Observation: if this is written as a triangle (see example) then at least the first five row sums coincide with A002001. - Omar E. Pol, Nov 28 2011

			Contribution from Omar E. Pol, Nov 26 2011 (Start):
When written as a triangle this begins:
1,
3,0,
3,9,0,0,0,0,
3,9,0,9,27,0,0,0,0,0,0,0,0,0,0,0,0,0,
3,9,0,9,27,0,0,0,0,9,27,0,27,81,0,0,0,0,0,0,0,0,0,0,0,...
(End)

David Applegate, Omar E. Pol and N. J. A. Sloane, The Toothpick Sequence and Other Sequences from Cellular Automata, Congressus Numerantium, Vol. 206 (2010), 157-191. [There is a typo in Theorem 6: (13) should read u(n) = 4.3^(wt(n-1)-1) for n >= 2.]
N. J. A. Sloane, Catalog of Toothpick and Cellular Automata Sequences in the OEIS

For generating functions Prod_{k>=0} (1+a*x^(b^k)) for the following values of (a,b) see: (1,2) A000012 and A000027, (1,3) A039966 and A005836, (1,4) A151666 and A000695, (1,5) A151667 and A033042, (2,2) A001316, (2,3) A151668, (2,4) A151669, (2,5) A151670, (3,2) A048883, (3,3) A117940, (3,4) A151665, (3,5) A151671, (4,2) A102376, (4,3) A151672, (4,4) A151673, (4,5) A151674.

G.f.: Product{k>=0, 1+3x^(3^k)}; a(n)=sum{k=0..n, sum{j=0..n, L(C(n,j)/3)*L(C(n-j,k)/3)}} where L(j/p) is the Legendre symbol of j and p.

A048967 Number of even entries in row n of Pascal's triangle (A007318).

Original entry on oeis.org

0, 0, 1, 0, 3, 2, 3, 0, 7, 6, 7, 4, 9, 6, 7, 0, 15, 14, 15, 12, 17, 14, 15, 8, 21, 18, 19, 12, 21, 14, 15, 0, 31, 30, 31, 28, 33, 30, 31, 24, 37, 34, 35, 28, 37, 30, 31, 16, 45, 42, 43, 36, 45, 38, 39, 24, 49, 42, 43, 28, 45, 30, 31, 0, 63, 62, 63, 60, 65, 62, 63, 56, 69, 66, 67

Offset: 0

Brian Galebach

In rows 2^k - 1 all entries are odd.
a(n) = 0 (all the entries in the row are odd) iff n = 2^m - 1 for some m >= 0 and then n belongs to sequence A000225. - Avi Peretz (njk(AT)netvision.net.il), Apr 21 2001
Also number of zeros in n-th row of Sierpiński's triangle (cf. A047999): a(n) = A023416(A001317(n)). - Reinhard Zumkeller, Nov 24 2012

			Row 4 is 1 4 6 4 1 with 3 even entries so a(4)=3.

Seiichi Manyama, Table of n, a(n) for n = 0..10000 (terms 0..1000 from T. D. Noe)

Cf. A007318, A001316, A000120, A000225, A038573.

Cf. A249304.

import Data.List (transpose)
a048967 n = a048967_list !! n
a048967_list = 0 : xs where
   xs = 0 : concat (transpose [zipWith (+) [1..] xs, map (* 2) xs])
-- Reinhard Zumkeller, Nov 14 2014, Nov 24 2012

Table[n + 1 - Sum[ Mod[ Binomial[n, k], 2], {k, 0, n} ], {n, 0, 100} ]
a[n_] := n + 1 - 2^DigitCount[n, 2, 1]; Array[a, 100, 0] (* Amiram Eldar, Jul 27 2023 *)

a(n)=if(n<1,0,if(n%2==0,a(n/2)+n/2,2*a((n-1)/2)))

def A048967(n): return n+1-(1<Chai Wah Wu, May 03 2023

a(n) = n+1 - A001316(n) = n+1 - 2^A000120(n) = n+1 - Sum_{k=0..n} (C(n, k) mod 2) = Sum_{k=0..n} ((1 - C(n, k)) mod 2).
a(2n) = a(n) + n, a(2n+1) = 2a(n). - Ralf Stephan, Oct 07 2003
a(n) = row sums in A219463 = A000120(A219843(n)). - Reinhard Zumkeller, Nov 30 2012
A249304(n+1) = a(n+1) + a(n). - Reinhard Zumkeller, Nov 14 2014
G.f.: 1/(1 - x)^2 - Product_{k>=0} (1 + 2*x^(2^k)). - Ilya Gutkovskiy, Jul 19 2019

A151666 Number of partitions of n into distinct powers of 4.

Original entry on oeis.org

1, 1, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0

Offset: 0

N. J. A. Sloane, May 30 2009

nonn

Reinhard Zumkeller, Table of n, a(n) for n = 0..10000
David Applegate, Omar E. Pol and N. J. A. Sloane, The Toothpick Sequence and Other Sequences from Cellular Automata, Congressus Numerantium, Vol. 206 (2010), 157-191. [There is a typo in Theorem 6: (13) should read u(n) = 4.3^(wt(n-1)-1) for n >= 2.]
Lukasz Merta, Composition inverses of the variations of the Baum-Sweet sequence, arXiv:1803.00292 [math.NT], 2018. See q(n) (with different offset) p. 9.
N. J. A. Sloane, Catalog of Toothpick and Cellular Automata Sequences in the OEIS

Cf. A039966, A151667, A000695, A269707.

a151666 n = fromEnum (n < 2 || m < 2 && a151666 n' == 1)
   where (n', m) = divMod n 4
-- Reinhard Zumkeller, Dec 03 2011

terms = 105;
kmax = Log[4, terms] // Ceiling;
CoefficientList[Product[1+x^(4^k), {k, 0, kmax}] + O[x]^(kmax terms), x][[1 ;; terms]] (* Jean-François Alcover, Jul 31 2018 *)

G.f.: Prod_{k >= 0 } (1+x^(4^k)). Exponents give A000695.

G.f. A(x) satisfies: A(x) = (1 + x) * A(x^4). - Ilya Gutkovskiy, Aug 12 2019

A382720 Number of entries in the n-th row of Pascal's triangle not divisible by 7.

Original entry on oeis.org

1, 2, 3, 4, 5, 6, 7, 2, 4, 6, 8, 10, 12, 14, 3, 6, 9, 12, 15, 18, 21, 4, 8, 12, 16, 20, 24, 28, 5, 10, 15, 20, 25, 30, 35, 6, 12, 18, 24, 30, 36, 42, 7, 14, 21, 28, 35, 42, 49, 2, 4, 6, 8, 10, 12, 14, 4, 8, 12, 16, 20, 24, 28, 6, 12, 18, 24, 30, 36, 42, 8, 16, 24, 32, 40, 48, 56, 10, 20, 30, 40

Offset: 0

N. J. A. Sloane, Apr 23 2025

nonn

Hsien-Kuei Hwang, Svante Janson, and Tsung-Hsi Tsai, Periodic minimum in the count of binomial coefficients not divisible by a prime, arXiv:2408.06817 [math.NT], 2024.

Cf. A001316, A006047, A194459, A382721-A382722, A382726.

a[n_] := Times @@ (IntegerDigits[n, 7] + 1);Array[a,81,0] (* James C. McMahon, Aug 16 2025 *)

from math import prod
from gmpy2 import digits
def A382720(n): return prod(int(d)+1 for d in digits(n,7)) # Chai Wah Wu, Aug 10 2025

A151665 G.f.: Product_{k>=0} (1 + 3*x^(4^k)).

Original entry on oeis.org

1, 3, 0, 0, 3, 9, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 9, 0, 0, 9, 27, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 9, 0, 0, 9, 27, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 9, 27, 0, 0, 27, 81, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0

Offset: 0

N. J. A. Sloane, May 30 2009

nonn

David Applegate, Omar E. Pol and N. J. A. Sloane, The Toothpick Sequence and Other Sequences from Cellular Automata, Congressus Numerantium, Vol. 206 (2010), 157-191. [There is a typo in Theorem 6: (13) should read u(n) = 4.3^(wt(n-1)-1) for n >= 2.]
N. J. A. Sloane, Catalog of Toothpick and Cellular Automata Sequences in the OEIS

For generating functions Product_{k>=0} (1 + a*x^(b^k)) for the following values of (a,b) see: (1,2) A000012 and A000027, (1,3) A039966 and A005836, (1,4) A151666 and A000695, (1,5) A151667 and A033042, (2,2) A001316, (2,3) A151668, (2,4) A151669, (2,5) A151670, (3,2) A048883, (3,3) A117940, (3,4) A151665, (3,5) A151671, (4,2) A102376, (4,3) A151672, (4,4) A151673, (4,5) A151674.

A151667 Number of partitions of n into distinct powers of 5.

Original entry on oeis.org

1, 1, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0

Offset: 0

N. J. A. Sloane, May 30 2009

nonn

Alois P. Heinz, Table of n, a(n) for n = 0..15625
David Applegate, Omar E. Pol and N. J. A. Sloane, The Toothpick Sequence and Other Sequences from Cellular Automata, Congressus Numerantium, Vol. 206 (2010), 157-191. [There is a typo in Theorem 6: (13) should read u(n) = 4.3^(wt(n-1)-1) for n >= 2.]
N. J. A. Sloane, Catalog of Toothpick and Cellular Automata Sequences in the OEIS

Cf. A039966, A151666, A033042.

m = 130; A[_] = 1;
Do[A[x_] = (1+x) A[x^5] + O[x]^m // Normal, {m}];
CoefficientList[A[x], x] (* Jean-François Alcover, Oct 19 2019 *)

G.f.: Prod_{k >= 0 } (1+x^(5^k)). Exponents give A033042.

G.f. A(x) satisfies: A(x) = (1 + x) * A(x^5). - Ilya Gutkovskiy, Aug 12 2019

A151668 G.f.: Product_{k>=0} (1 + 2*x^(3^k)).

Original entry on oeis.org

1, 2, 0, 2, 4, 0, 0, 0, 0, 2, 4, 0, 4, 8, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 4, 0, 4, 8, 0, 0, 0, 0, 4, 8, 0, 8, 16, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 4, 0, 4, 8, 0, 0, 0, 0, 4, 8, 0, 8, 16, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0

Offset: 0

N. J. A. Sloane, May 30 2009

nonn

David Applegate, Omar E. Pol and N. J. A. Sloane, The Toothpick Sequence and Other Sequences from Cellular Automata, Congressus Numerantium, Vol. 206 (2010), 157-191. [There is a typo in Theorem 6: (13) should read u(n) = 4.3^(wt(n-1)-1) for n >= 2.]
N. J. A. Sloane, Catalog of Toothpick and Cellular Automata Sequences in the OEIS

A151669 G.f.: Product_{k>=0} (1 + 2*x^(4^k)).

Original entry on oeis.org

1, 2, 0, 0, 2, 4, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 4, 0, 0, 4, 8, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 4, 0, 0, 4, 8, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4, 8, 0, 0, 8, 16, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0

Offset: 0

N. J. A. Sloane, May 30 2009

nonn

David Applegate, Omar E. Pol and N. J. A. Sloane, The Toothpick Sequence and Other Sequences from Cellular Automata, Congressus Numerantium, Vol. 206 (2010), 157-191. [There is a typo in Theorem 6: (13) should read u(n) = 4.3^(wt(n-1)-1) for n >= 2.]
N. J. A. Sloane, Catalog of Toothpick and Cellular Automata Sequences in the OEIS

cp's OEIS Frontend

A080100 a(n) = 2^(number of 0's in binary representation of n).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Haskell

Maple

Mathematica

PARI

PARI

Python

Formula

Extensions

A160464 The Eta triangle.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Maple

Formula

A117940 a(0)=1, thereafter a(3n) = a(3n+1)/3 = a(n), a(3n+2)=0.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Formula

A048967 Number of even entries in row n of Pascal's triangle (A007318).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Haskell

Mathematica

PARI

Python

Formula

A151666 Number of partitions of n into distinct powers of 4.

Views

Author

Keywords

Links

Crossrefs

Programs

Haskell

Mathematica

Formula

A382720 Number of entries in the n-th row of Pascal's triangle not divisible by 7.

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

Python

A151665 G.f.: Product_{k>=0} (1 + 3*x^(4^k)).

Views

Author

Keywords

Links

Crossrefs

A151667 Number of partitions of n into distinct powers of 5.

Views

Author