A001316 -id:A001316 - cp's OEIS frontend

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

1, 2, 0, 0, 0, 2, 4, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 4, 0, 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, 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

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.

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

Original entry on oeis.org

1, 3, 0, 0, 0, 3, 9, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 9, 0, 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, 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

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.

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

Original entry on oeis.org

1, 4, 0, 4, 16, 0, 0, 0, 0, 4, 16, 0, 16, 64, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4, 16, 0, 16, 64, 0, 0, 0, 0, 16, 64, 0, 64, 256, 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, 4, 16, 0, 16, 64, 0, 0, 0, 0, 16, 64, 0, 64, 256, 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.

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

Original entry on oeis.org

1, 4, 0, 0, 4, 16, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4, 16, 0, 0, 16, 64, 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, 4, 16, 0, 0, 16, 64, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 16, 64, 0, 0, 64, 256, 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.

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

Original entry on oeis.org

1, 4, 0, 0, 0, 4, 16, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4, 16, 0, 0, 0, 16, 64, 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

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.

A246660 Run Length Transform of factorials.

Original entry on oeis.org

1, 1, 1, 2, 1, 1, 2, 6, 1, 1, 1, 2, 2, 2, 6, 24, 1, 1, 1, 2, 1, 1, 2, 6, 2, 2, 2, 4, 6, 6, 24, 120, 1, 1, 1, 2, 1, 1, 2, 6, 1, 1, 1, 2, 2, 2, 6, 24, 2, 2, 2, 4, 2, 2, 4, 12, 6, 6, 6, 12, 24, 24, 120, 720, 1, 1, 1, 2, 1, 1, 2, 6, 1, 1, 1, 2, 2, 2, 6, 24, 1, 1, 1

Offset: 0

Peter Luschny, Sep 07 2014

For the definition of the Run Length Transform see A246595.

Only Jordan-Polya numbers (A001013) are terms of this sequence.

Antti Karttunen, Table of n, a(n) for n = 0..8192
Index entries for sequences computed with run length transform

Cf. A000142, A001013, A007814, A112624, A323505, A323506.
Cf. A003714 (gives the positions of ones).
Run Length Transforms of other sequences: A001316, A071053, A227349, A246588, A246595, A246596, A246661, A246674.

Table[Times @@ (Length[#]!&) /@ Select[Split[IntegerDigits[n, 2]], #[[1]] == 1&], {n, 0, 83}] (* Jean-François Alcover, Jul 11 2017 *)

A246660(n) = { my(i=0, p=1); while(n>0, if(n%2, i++; p = p * i, i = 0); n = n\2); p; };
for(n=0, 8192, write("b246660.txt", n, " ", A246660(n)));
\\ Antti Karttunen, Sep 08 2014

from operator import mul
from functools import reduce
from re import split
from math import factorial
def A246660(n):
    return reduce(mul,(factorial(len(d)) for d in split('0+',bin(n)[2:]) if d)) if n > 0 else 1 # Chai Wah Wu, Sep 09 2014

def RLT(f, size):
    L = lambda n: [a for a in Integer(n).binary().split('0') if a != '']
    return [mul([f(len(d)) for d in L(n)]) for n in range(size)]
A246660_list = lambda len: RLT(factorial, len)
A246660_list(88)

;; A stand-alone loop version, like the Pari-program above:
(define (A246660 n) (let loop ((n n) (i 0) (p 1)) (cond ((zero? n) p) ((odd? n) (loop (/ (- n 1) 2) (+ i 1) (* p (+ 1 i)))) (else (loop (/ n 2) 0 p)))))
;; One based on given recurrence, utilizing memoizing definec-macro from my IntSeq-library:
(definec (A246660 n) (cond ((zero? n) 1) ((even? n) (A246660 (/ n 2))) (else (* (A007814 (+ n 1)) (A246660 (/ (- n 1) 2))))))
;; Yet another implementation, using fold:
(define (A246660 n) (fold-left (lambda (a r) (* a (A000142 r))) 1 (bisect (reverse (binexp->runcount1list n)) (- 1 (modulo n 2)))))
(definec (A000142 n) (if (zero? n) 1 (* n (A000142 (- n 1)))))
;; Other functions are as in A227349 - Antti Karttunen, Sep 08 2014

a(2^n-1) = n!.
a(0) = 1, a(2n) = a(n), a(2n+1) = a(n) * A007814(2n+2). - Antti Karttunen, Sep 08 2014
a(n) = A112624(A005940(1+n)). - Antti Karttunen, May 29 2017
a(n) = A323505(n) / A323506(n). - Antti Karttunen, Jan 17 2019

A037301 Numbers whose base-2 and base-3 expansions have the same digit sum.

Original entry on oeis.org

0, 1, 6, 7, 10, 11, 12, 13, 18, 19, 21, 36, 37, 46, 47, 58, 59, 60, 61, 86, 92, 102, 103, 114, 115, 120, 121, 166, 167, 172, 173, 180, 181, 198, 199, 216, 217, 222, 223, 261, 273, 282, 283, 285, 298, 299, 300, 301, 306, 307, 309, 318

Offset: 1

Clark Kimberling

If Sum_{i=0..k} (binomial(k,i) mod 2) == Sum_{i=0..k} (binomial(k,i) mod 3) then k is in the sequence. (The converse does not hold.) - Benoit Cloitre, Nov 16 2003
Problem: To prove that the sequence is infinite. A generalization: Let s_m(k) denote the sum of digits of k in base m; does the Diophantine equation s_p(k) = s_q(k), where p,q are fixed distinct primes, have infinitely many solutions? - Vladimir Shevelev, Jul 30 2009
Also, numbers k such that the exponent of the largest power of 2 dividing k! is exactly twice the exponent of the largest power of 3 dividing k!. - Ivan Neretin, Mar 08 2015
a(5) = 10, a(6) = 11, a(7) = 12 and a(8) = 13 is the first time that four consecutive terms appear in this sequence. Conjecture: There is no occurrence of five or more consecutive terms of a(n). Tested by exhaustive search up to a(n) = 3^29. - Thomas König, Aug 15 2020

Stanislav Sykora, Table of n, a(n) for n = 1..10000
Vladimir Shevelev, Compact integers and factorials, Acta Arith. 126 (2007), no. 3, 195-236.
Vladimir Shevelev, Binomial predictors, arXiv:0907.3302 [math.NT], 2009.
Lukas Spiegelhofer, Collisions of the binary and ternary sum-of-digits functions, arXiv:2105.11173 [math.NT], 2021. Proves that sequence is infinite.

Cf. A000120, A053735, A180017.

Cf. A001316, A051638, A212222, A330904, A334765.

Select[ Range@ 320, Total@ IntegerDigits[#, 2] == Total@ IntegerDigits[#, 3] &] (* Robert G. Wilson v, Oct 24 2014 *)

is(n)=sumdigits(n,3)==hammingweight(n) \\ Charles R Greathouse IV, May 21 2015

A053735(a(n)) = A000120(a(n)); A180017(a(n)) = 0. - Reinhard Zumkeller, Aug 06 2010

Zero prepended by Zak Seidov, May 31 2010

A051638 a(n) = Sum_{k=0..n} (C(n,k) mod 3).

Original entry on oeis.org

1, 2, 4, 2, 4, 8, 4, 8, 13, 2, 4, 8, 4, 8, 16, 8, 16, 26, 4, 8, 13, 8, 16, 26, 13, 26, 40, 2, 4, 8, 4, 8, 16, 8, 16, 26, 4, 8, 16, 8, 16, 32, 16, 32, 52, 8, 16, 26, 16, 32, 52, 26, 52, 80, 4, 8, 13, 8, 16, 26, 13, 26, 40, 8, 16, 26, 16, 32, 52, 26, 52, 80, 13

Offset: 0

N. J. A. Sloane

Row sums of the triangle in A083093. - Reinhard Zumkeller, Jul 11 2013

Reinhard Zumkeller, Table of n, a(n) for n = 0..6561=3^8
Michael Gilleland, Some Self-Similar Integer Sequences
A. Granville, Binomials modulo a prime

Cf. A001316.

a051638 = sum . a083093_row  -- Reinhard Zumkeller, Jul 11 2013

Table[2^(DigitCount[n,3,1]-1) (3^(DigitCount[n,3,2]+1)-1),{n,0,80}] (* Harvey P. Dale, Jun 20 2019 *)

from gmpy2 import digits
def A051638(n): return 3*3**(s:=digits(n,3)).count('2')-1<>1 # Chai Wah Wu, Jun 25 2025

Write n in base 3; if the representation contains r 1's and s 2's then a(n) = 2^{r-1} * (3^(s+1) - 1) = 1/2 * (3*A006047(n) - 2^(A062756(n))). - Robin Chapman, Ahmed Fares (ahmedfares(AT)my-deja.com) and others, Jul 16 2001

a(3n) = a(n), a(3n+1) = 2a(n), a(9n+2) = a(3n+2), a(9n+5) = 2a(3n+2), a(9n+8) = 4a(3n+2) - 3a(n). - David Radcliffe, Jun 25 2025

A061549 Denominator of probability that there is no error when average of n numbers is computed, assuming errors of +1, -1 are possible and they each occur with p=1/4.

Original entry on oeis.org

1, 8, 128, 1024, 32768, 262144, 4194304, 33554432, 2147483648, 17179869184, 274877906944, 2199023255552, 70368744177664, 562949953421312, 9007199254740992, 72057594037927936, 9223372036854775808, 73786976294838206464, 1180591620717411303424, 9444732965739290427392

Offset: 0

Leah Schmelzer (leah2002(AT)mit.edu), May 16 2001

We observe that b(n) = log(a(n))/log(2) = A120738(n). Furthermore c(n+1) = b(n+1)-b(n) = A090739(n+1) and c(n+1)-3 = A007814(n+1) for n>=0. - Johannes W. Meijer, Jul 06 2009

Using WolframAlpha, it appears that 2*a(n) gives the coefficients of Pi in the denominators of the residues of f(z) = 2z choose z at odd negative half integers. E.g., the residues of f(z) at z = -1/2, -3/2, -5/2 are 1/(2*Pi), 1/(16*Pi), and 3/(256*Pi) respectively. - Nicholas Juricic, Mar 31 2022

			For n=1, the binomial(2*n-1/2, -1/2) yields the term 3/8. The denominator of this term is 8, which is the second term of the sequence.

Indranil Ghosh, Table of n, a(n) for n = 0..500
Robert M. Kozelka, Grade Point Averages and the Central Limit Theorem, American Mathematical Monthly. Nov. 1979 (86:9) pp. 773-7.
Eric Weisstein's World of Mathematics, Circle Line Picking
Eric Weisstein's World of Mathematics, Gamma Function

Cf. A007814, A061548, A090739.
Bisection of A046161.
Appears in A162448.

A061549:= func< n | 2^(4*n-(&+Intseq(2*n, 2))) >;
[A061549(n): n in [0..30]]; // G. C. Greubel, Oct 20 2024

seq(denom(binomial(2*n-1/2, -1/2)), n=0..20);

Table[Denominator[(4*n)!/(2^(4*n)*(2*n)!^2) ], {n, 0, 20}] (* Indranil Ghosh, Mar 11 2017 *)

for(n=0, 20, print1(denominator((4*n)!/(2^(4*n)*(2*n)!^2)),", ")) \\ Indranil Ghosh, Mar 11 2017

import math
f = math.factorial
def A061549(n): return (2**(4*n)*f(2*n)**2) // math.gcd(f(4*n), (2**(4*n)*f(2*n)**2)) # Indranil Ghosh, Mar 11 2017

# uses[A000120]
def a(n): return 1 << (4*n - A000120(n))
[a(n) for n in (0..19)]  # Peter Luschny, Dec 02 2012

a(n) = denominator of binomial(2*n-1/2, -1/2).
a(n) are denominators of coefficients of 1/(sqrt(1+x)-sqrt(1-x)) power series. - Benoit Cloitre, Mar 12 2002
a(n) = 16^n/A001316(n). - Paul Barry, Jun 29 2006
a(n) = denom((4*n)!/(2^(4*n)*(2*n)!^2)). - Johannes W. Meijer, Jul 06 2009
a(n) = abs(A067624(n)/A117972(n)). - Johannes W. Meijer, Jul 06 2009

More terms from Asher Auel, May 20 2001

A246035 Number of odd terms in f^n, where f = (1/x+1+x)*(1/y+1+y).

Original entry on oeis.org

1, 9, 9, 25, 9, 81, 25, 121, 9, 81, 81, 225, 25, 225, 121, 441, 9, 81, 81, 225, 81, 729, 225, 1089, 25, 225, 225, 625, 121, 1089, 441, 1849, 9, 81, 81, 225, 81, 729, 225, 1089, 81, 729, 729, 2025, 225, 2025, 1089, 3969, 25, 225, 225, 625, 225, 2025, 625, 3025, 121, 1089, 1089, 3025, 441, 3969, 1849, 7225, 9, 81, 81, 225, 81, 729, 225

Offset: 0

N. J. A. Sloane, Aug 20 2014

nonn

This is the number of ON cells in a certain 2-D CA in which the neighborhood of a cell is defined by f, and in which a cell is ON iff there was an odd number of ON cells in the neighborhood at the previous generation.
This is the odd-rule cellular automaton defined by OddRule 777 (see Ekhad-Sloane-Zeilberger "Odd-Rule Cellular Automata on the Square Grid" link).
Run Length Transform of {A001045(k+2)^2} (or of A139818).
The Run Length Transform of a sequence {S(n), n>=0} is defined to be the sequence {T(n), n>=0} given by T(n) = Product_i S(i), where i runs through the lengths of runs of 1's in the binary expansion of n. E.g. 19 is 10011 in binary, which has two runs of 1's, of lengths 1 and 2. So T(19) = S(1)*S(2). T(0)=1 (the empty product).

			Here is the neighborhood:
[X, X, X]
[X, X, X]
[X, X, X]
which contains a(1) = 9 ON cells.
.
From Omar E. Pol, Mar 17 2015: (Start)
Apart from the initial 1, the sequence can be written also as an irregular tetrahedron T(s,r,k) = A139818(r+2) * a(k), s>=1, 1<=r<=s, 0<=k<=(A011782(s-r)-1) as shown below:
..
9;
...
9;
25;
..........
9,     81;
25;
121;
....................
9,     81,  81, 225;
25,   225;
121;
441;
........................................
9,     81,  81, 225, 81, 729, 225, 1089;
25,   225, 225, 625;
121, 1089;
441;
1849;
...
Note that every row r is equal to A139818(r+2) times the beginning of the sequence itself, thus in 3D every column contains the same number: T(s,r,k) = T(s+1,r,k).
(End)

Alois P. Heinz, Table of n, a(n) for n = 0..8192
Shalosh B. Ekhad, N. J. A. Sloane, and Doron Zeilberger, A Meta-Algorithm for Creating Fast Algorithms for Counting ON Cells in Odd-Rule Cellular Automata, arXiv:1503.01796 [math.CO], 2015; see also the Accompanying Maple Package.
Shalosh B. Ekhad, N. J. A. Sloane, and Doron Zeilberger, Odd-Rule Cellular Automata on the Square Grid, arXiv:1503.04249 [math.CO], 2015.
N. J. A. Sloane, On the No. of ON Cells in Cellular Automata, Video of talk in Doron Zeilberger's Experimental Math Seminar at Rutgers University, Feb. 05 2015: Part 1, Part 2
N. J. A. Sloane, On the Number of ON Cells in Cellular Automata, arXiv:1503.01168 [math.CO], 2015.
Index entries for sequences related to cellular automata

Other CA's that use the same rule but with different cell neighborhoods: A160239, A102376, A071053, A072272, A001316, A246034.

Cf. A001045, A139818.

C:=f->subs({x=1, y=1}, f);
# Find number of ON cells in CA for generations 0 thru M defined by rule
# that cell is ON iff number of ON cells in nbd at time n-1 was odd
# where nbd is defined by a polynomial or Laurent series f(x, y).
OddCA:=proc(f, M) global C; local n, a, i, f2, p;
f2:=simplify(expand(f)) mod 2;
a:=[]; p:=1;
for n from 0 to M do a:=[op(a), C(p)]; p:=expand(p*f2) mod 2; od:
lprint([seq(a[i], i=1..nops(a))]);
end;
f:=(1/x+1+x)*(1/y+1+y);
OddCA(f, 70);

b[0] = 1; b[n_] := b[n] = Expand[b[n - 1]*(x^2 + x + 1)];
a[n_] := Count[CoefficientList[b[n], x], _?OddQ]^2;
Table[a[n], {n, 0, 100}] (* Jean-François Alcover, Apr 30 2017 *)

a(n) = A071053(n)^2.

cp's OEIS Frontend

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

Views

Author

Keywords

Links

Crossrefs

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

Views

Author

Keywords

Links

Crossrefs

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

Views

Author

Keywords

Links

Crossrefs

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

Views

Author

Keywords

Links

Crossrefs

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

Views

Author

Keywords

Links

Crossrefs

A246660 Run Length Transform of factorials.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

PARI

Python

Sage

Scheme

Formula

A037301 Numbers whose base-2 and base-3 expansions have the same digit sum.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

PARI

Formula

Extensions

A051638 a(n) = Sum_{k=0..n} (C(n,k) mod 3).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Haskell

Mathematica

Python

Formula

A061549 Denominator of probability that there is no error when average of n numbers is computed, assuming errors of +1, -1 are possible and they each occur with p=1/4.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Magma

Maple