cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-7 of 7 results.

A002450 a(n) = (4^n - 1)/3.

Original entry on oeis.org

0, 1, 5, 21, 85, 341, 1365, 5461, 21845, 87381, 349525, 1398101, 5592405, 22369621, 89478485, 357913941, 1431655765, 5726623061, 22906492245, 91625968981, 366503875925, 1466015503701, 5864062014805, 23456248059221, 93824992236885, 375299968947541
Offset: 0

Views

Author

N. J. A. Sloane

Keywords

Comments

For n > 0, a(n) is the degree (n-1) "numbral" power of 5 (see A048888 for the definition of numbral arithmetic). Example: a(3) = 21, since the numbral square of 5 is 5(*)5 = 101(*)101(base 2) = 101 OR 10100 = 10101(base 2) = 21, where the OR is taken bitwise. - John W. Layman, Dec 18 2001
a(n) is composite for all n > 2 and has factors x, (3*x + 2*(-1)^n) where x belongs to A001045. In binary the terms greater than 0 are 1, 101, 10101, 1010101, etc. - John McNamara, Jan 16 2002
Number of n X 2 binary arrays with path of adjacent 1's from upper left corner to right column. - R. H. Hardin, Mar 16 2002
The Collatz-function iteration started at a(n), for n >= 1, will end at 1 after 2*n+1 steps. - Labos Elemer, Sep 30 2002 [corrected by Wolfdieter Lang, Aug 16 2021]
Second binomial transform of A001045. - Paul Barry, Mar 28 2003
All members of sequence are also generalized octagonal numbers (A001082). - Matthew Vandermast, Apr 10 2003
Also sum of squares of divisors of 2^(n-1): a(n) = A001157(A000079(n-1)), for n > 0. - Paul Barry, Apr 11 2003
Binomial transform of A000244 (with leading zero). - Paul Barry, Apr 11 2003
Number of walks of length 2n between two vertices at distance 2 in the cycle graph C_6. For n = 2 we have for example 5 walks of length 4 from vertex A to C: ABABC, ABCBC, ABCDC, AFABC and AFEDC. - Herbert Kociemba, May 31 2004
Also number of walks of length 2n + 1 between two vertices at distance 3 in the cycle graph C_12. - Herbert Kociemba, Jul 05 2004
a(n+1) is the number of steps that are made when generating all n-step random walks that begin in a given point P on a two-dimensional square lattice. To make one step means to mark one vertex on the lattice (compare A080674). - Pawel P. Mazur (Pawel.Mazur(AT)pwr.wroc.pl), Mar 13 2005
a(n+1) is the sum of square divisors of 4^n. - Paul Barry, Oct 13 2005
a(n+1) is the decimal number generated by the binary bits in the n-th generation of the Rule 250 elementary cellular automaton. - Eric W. Weisstein, Apr 08 2006
a(k) = [M^k]2,1, where M is the 3 X 3 matrix defined as follows: M = [1, 1, 1; 1, 3, 1; 1, 1, 1]. - _Simone Severini, Jun 11 2006
a(n-1) / a(n) = percentage of wasted storage if a single image is stored as a pyramid with a each subsequent higher resolution layer containing four times as many pixels as the previous layer. n is the number of layers. - Victor Brodsky (victorbrodsky(AT)gmail.com), Jun 15 2006
k is in the sequence if and only if C(4k + 1, k) (A052203) is odd. - Paul Barry, Mar 26 2007
This sequence also gives the number of distinct 3-colorings of the odd cycle C(2*n - 1). - Keith Briggs, Jun 19 2007
All numbers of the form m*4^m + (4^m-1)/3 have the property that they are sums of two squares and also their indices are the sum of two squares. This follows from the identity m*4^m + (4^m-1)/3 = 4(4(..4(4m + 1) + 1) + 1) + 1 ..) + 1. - Artur Jasinski, Nov 12 2007
For n > 0, terms are the numbers that, in base 4, are repunits: 1_4, 11_4, 111_4, 1111_4, etc. - Artur Jasinski, Sep 30 2008
Let A be the Hessenberg matrix of order n, defined by: A[1, j] = 1, A[i, i] := 5, (i > 1), A[i, i - 1] = -1, and A[i, j] = 0 otherwise. Then, for n >= 1, a(n) = charpoly(A,1). - Milan Janjic, Jan 27 2010
This is the sequence A(0, 1; 3, 4; 2) = A(0, 1; 4, 0; 1) of the family of sequences [a, b : c, d : k] considered by G. Detlefs, and treated as A(a, b; c, d; k) in the W. Lang link given below. - Wolfdieter Lang, Oct 18 2010
6*a(n) + 1 is every second Mersenne number greater than or equal to M3, hence all Mersenne primes greater than M2 must be a 6*a(n) + 1 of this sequence. - Roderick MacPhee, Nov 01 2010
Smallest number having alternating bit sum n. Cf. A065359.
For n = 1, 2, ..., the last digit of a(n) is 1, 5, 1, 5, ... . - Washington Bomfim, Jan 21 2011
Rule 50 elementary cellular automaton generates this sequence. This sequence also appears in the second column of array in A173588. - Paul Muljadi, Jan 27 2011
Sequence found by reading the line from 0, in the direction 0, 5, ... and the line from 1, in the direction 1, 21, ..., in the square spiral whose edges are the Jacobsthal numbers A001045 and whose vertices are the numbers A000975. These parallel lines are two semi-diagonals in the spiral. - Omar E. Pol, Sep 10 2011
a(n), n >= 1, is also the inverse of 3, denoted by 3^(-1), Modd(2^(2*n - 1)). For Modd n see a comment on A203571. E.g., a(2) = 5, 3 * 5 = 15 == 1 (Modd 8), because floor(15/8) = 1 is odd and -15 == 1 (mod 8). For n = 1 note that 3 * 1 = 3 == 1 (Modd 2) because floor(3/2) = 1 and -3 == 1 (mod 2). The inverse of 3 taken Modd 2^(2*n) coincides with 3^(-1) (mod 2^(2*n)) given in A007583(n), n >= 1. - Wolfdieter Lang, Mar 12 2012
If an AVL tree has a leaf at depth n, then the tree can contain no more than a(n+1) nodes total. - Mike Rosulek, Nov 20 2012
Also, this is the Lucas sequence V(5, 4). - Bruno Berselli, Jan 10 2013
Also, for n > 0, a(n) is an odd number whose Collatz trajectory contains no odd number other than n and 1. - Jayanta Basu, Mar 24 2013
Sum_{n >= 1} 1/a(n) converges to (3*(log(4/3) - QPolyGamma[0, 1, 1/4]))/log(4) = 1.263293058100271... = A321873. - K. G. Stier, Jun 23 2014
Consider n spheres in R^n: the i-th one (i=1, ..., n) has radius r(i) = 2^(1-i) and the coordinates of its center are (0, 0, ..., 0, r(i), 0, ..., 0) where r(i) is in position i. The coordinates of the intersection point in the positive orthant of these spheres are (2/a(n), 4/a(n), 8/a(n), 16/a(n), ...). For example in R^2, circles centered at (1, 0) and (0, 1/2), and with radii 1 and 1/2, meet at (2/5, 4/5). - Jean M. Morales, May 19 2015
From Peter Bala, Oct 11 2015: (Start)
a(n) gives the values of m such that binomial(4*m + 1,m) is odd. Cf. A003714, A048716, A263132.
2*a(n) = A020988(n) gives the values of m such that binomial(4*m + 2, m) is odd.
4*a(n) = A080674(n) gives the values of m such that binomial(4*m + 4, m) is odd. (End)
Collatz Conjecture Corollary: Except for powers of 2, the Collatz iteration of any positive integer must eventually reach a(n) and hence terminate at 1. - Gregory L. Simay, May 09 2016
Number of active (ON, black) cells at stage 2^n - 1 of the two-dimensional cellular automaton defined by "Rule 598", based on the 5-celled von Neumann neighborhood. - Robert Price, May 16 2016
From Luca Mariot and Enrico Formenti, Sep 26 2016: (Start)
a(n) is also the number of coprime pairs of polynomials (f, g) over GF(2) where both f and g have degree n + 1 and nonzero constant term.
a(n) is also the number of pairs of one-dimensional binary cellular automata with linear and bipermutive local rule of neighborhood size n+1 giving rise to orthogonal Latin squares of order 2^m, where m is a multiple of n. (End)
Except for 0, 1 and 5, all terms are Brazilian repunits numbers in base 4, and so belong to A125134. For n >= 3, all these terms are composite because a(n) = {(2^n-1) * (2^n + 1)}/3 and either (2^n - 1) or (2^n + 1) is a multiple of 3. - Bernard Schott, Apr 29 2017
Given the 3 X 3 matrix A = [2, 1, 1; 1, 2, 1; 1, 1, 2] and the 3 X 3 unit matrix I_3, A^n = a(n)(A - I_3) + I_3. - Nicolas Patrois, Jul 05 2017
The binary expansion of a(n) (n >= 1) consists of n 1's alternating with n - 1 0's. Example: a(4) = 85 = 1010101_2. - Emeric Deutsch, Aug 30 2017
a(n) (n >= 1) is the viabin number of the integer partition [n, n - 1, n - 2, ..., 2, 1] (for the definition of viabin number see comment in A290253). Example: a(4) = 85 = 1010101_2; consequently, the southeast border of the Ferrers board of the corresponding integer partition is ENENENEN, where E = (1, 0), N = (0, 1); this leads to the integer partition [4, 3, 2, 1]. - Emeric Deutsch, Aug 30 2017
Numbers whose binary and Gray-code representations are both palindromes (i.e., intersection of A006995 and A281379). - Amiram Eldar, May 17 2021
Starting with n = 1 the sequence satisfies {a(n) mod 6} = repeat{1, 5, 3}. - Wolfdieter Lang, Jan 14 2022
Terms >= 5 are those q for which the multiplicative order of 2 mod q is floor(log_2(q)) + 2 (and which is 1 more than the smallest possible order for any q). - Tim Seuré, Mar 09 2024
The order of 2 modulo a(n) is 2*n for n >= 2. - Joerg Arndt, Mar 09 2024

Examples

			Apply Collatz iteration to 9: 9, 28, 14, 7, 22, 11, 34, 17, 52, 26, 13, 40, 20, 10, 5 and hence 16, 8, 4, 2, 1.
Apply Collatz iteration to 27: 27, 82, 41, 124, 62, 31, 94, 47, 142, 71, 214, 107, 322, 161, 484, 242, 121, 364, 182, 91, 274, 137, 412, 206, 103, 310, 155, 466, 233, 700, 350, 175, 526, 263, 790, 395, 1186, 593, 1780, 890, 445, 1336, 668, 334, 167, 502, 251, 754, 377, 1132, 566, 283, 850, 425, 1276, 638, 319, 958, 479, 1438, 719, 2158, 1079, 3238, 1619, 4858, 2429, 7288, 3644, 1822, 911, 2734, 1367, 4102, 2051, 6154, 3077, 9232, 4616, 2308, 1154, 577, 1732, 866, 433, 1300, 650, 325, 976, 488, 244, 122, 61, 184, 92, 46, 23, 70, 35, 106, 53, 160, 80, 40, 20, 10, 5 and hence 16, 8, 4, 2, 1. [Corrected by _Sean A. Irvine_ at the suggestion of Stephen Cornelius, Mar 04 2024]
a(5) = (4^5 - 1)/3 = 341 = 11111_4 = {(2^5 - 1) * (2^5 + 1)}/3 = 31 * 33/3 = 31 * 11. - _Bernard Schott_, Apr 29 2017

References

  • A. Fletcher, J. C. P. Miller, L. Rosenhead and L. J. Comrie, An Index of Mathematical Tables. Vols. 1 and 2, 2nd ed., Blackwell, Oxford and Addison-Wesley, Reading, MA, 1962, Vol. 1, p. 112.
  • J. Riordan, Combinatorial Identities, Wiley, 1968, p. 217.
  • N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
  • N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Links

Crossrefs

Partial sums of powers of 4, A000302.
When converted to binary, this gives A094028.
Subsequence of A003714.
Primitive factors: A129735.
Cf. A000225, A002446, A006995, A007583, A018215, A020988, A024036, A047849, A048716, A080355, A080674, A112627, A113860, A139391, A155701, A156605, A160967, A163834, A163868, A178415, A263132, A281379, A347834.

Programs

  • GAP
    List([0..25], n -> (4^n-1)/3); # Muniru A Asiru, Feb 18 2018
  • Haskell
    a002450 = (`div` 3) . a024036
a002450_list = iterate ((+ 1) . (* 4)) 0
-- Reinhard Zumkeller, Oct 03 2012
  • Magma
    [ (4^n-1)/3: n in [0..25] ]; // Klaus Brockhaus, Oct 28 2008
  • Magma
    [n le 2 select n-1 else 5*Self(n-1)-4*Self(n-2): n in [1..70]]; // Vincenzo Librandi, Jun 13 2015
  • Maple
    [seq((4^n-1)/3,n=0..40)];
A002450:=1/(4*z-1)/(z-1); # Simon Plouffe in his 1992 dissertation, dropping the initial zero
  • Mathematica
    Table[(4^n - 1)/3, {n, 0, 127}] (* Vladimir Joseph Stephan Orlovsky, Sep 29 2008 *)
LinearRecurrence[{5, -4}, {0, 1}, 30] (* Harvey P. Dale, Jun 23 2013 *)
  • Maxima
    makelist((4^n-1)/3, n, 0, 30); /* Martin Ettl, Nov 05 2012 */
  • PARI
    a(n) = (4^n-1)/3;
  • PARI
    my(z='z+O('z^40)); Vec(z/((1-z)*(1-4*z))) \\ Altug Alkan, Oct 11 2015
  • Python
    def A002450(n): return ((1<<(n<<1))-1)//3 # Chai Wah Wu, Jan 29 2023
  • Scala
    ((List.fill(20)(4: BigInt)).scanLeft(1: BigInt)( * )).scanLeft(0: BigInt)( + ) // Alonso del Arte, Sep 17 2019

Formula

From Wolfdieter Lang, Apr 24 2001: (Start)
a(n+1) = Sum_{m = 0..n} A060921(n, m).
G.f.: x/((1-x)*(1-4*x)). (End)
a(n) = Sum_{k = 0..n-1} 4^k; a(n) = A001045(2*n). - Paul Barry, Mar 17 2003
E.g.f.: (exp(4*x) - exp(x))/3. - Paul Barry, Mar 28 2003
a(n) = (A007583(n) - 1)/2. - N. J. A. Sloane, May 16 2003
a(n) = A000975(2*n)/2. - N. J. A. Sloane, Sep 13 2003
a(n) = A084160(n)/2. - N. J. A. Sloane, Sep 13 2003
a(n+1) = 4*a(n) + 1, with a(0) = 0. - Philippe Deléham, Feb 25 2004
a(n) = Sum_{i = 0..n-1} C(2*n - 1 - i, i)*2^i. - Mario Catalani (mario.catalani(AT)unito.it), Jul 23 2004
a(n+1) = Sum_{k = 0..n} binomial(n+1, k+1)*3^k. - Paul Barry, Aug 20 2004
a(n) = center term in M^n * [1 0 0], where M is the 3 X 3 matrix [1 1 1 / 1 3 1 / 1 1 1]. M^n * [1 0 0] = [A007583(n-1) a(n) A007583(n-1)]. E.g., a(4) = 85 since M^4 * [1 0 0] = [43 85 43] = [A007583(3) a(4) A007583(3)]. - Gary W. Adamson, Dec 18 2004
a(n) = Sum_{k = 0..n, j = 0..n} C(n, j)*C(j, k)*A001045(j - k). - Paul Barry, Feb 15 2005
a(n) = Sum_{k = 0..n} C(n, k)*A001045(n-k)*2^k = Sum_{k = 0..n} C(n, k)*A001045(k)*2^(n-k). - Paul Barry, Apr 22 2005
a(n) = A125118(n, 3) for n > 2. - Reinhard Zumkeller, Nov 21 2006
a(n) = Sum_{k = 0..n} 2^(n - k)*A128908(n, k), n >= 1. - Philippe Deléham, Oct 19 2008
a(n) = Sum_{k = 0..n} A106566(n, k)*A100335(k). - Philippe Deléham, Oct 30 2008
If we define f(m, j, x) = Sum_{k = j..m} binomial(m, k)*stirling2(k, j)*x^(m - k) then a(n-1) = f(2*n, 4, -2), n >= 2. - Milan Janjic, Apr 26 2009
a(n) = A014551(n) * A001045(n). - R. J. Mathar, Jul 08 2009
a(n) = 4*a(n-1) + a(n-2) - 4*a(n-3) = 5*a(n-1) - 4*a(n-2), a(0) = 0, a(1) = 1, a(2) = 5. - Wolfdieter Lang, Oct 18 2010
a(0) = 0, a(n+1) = a(n) + 2^(2*n). - Washington Bomfim, Jan 21 2011
A036555(a(n)) = 2*n. - Reinhard Zumkeller, Jan 28 2011
a(n) = Sum_{k = 1..floor((n+2)/3)} C(2*n + 1, n + 2 - 3*k). - Mircea Merca, Jun 25 2011
a(n) = Sum_{i = 1..n} binomial(2*n + 1, 2*i)/3. - Wesley Ivan Hurt, Mar 14 2015
a(n+1) = 2^(2*n) + a(n), a(0) = 0. - Ben Paul Thurston, Dec 27 2015
a(k*n)/a(n) = 1 + 4^n + ... + 4^((k-1)*n). - Gregory L. Simay, Jun 09 2016
Dirichlet g.f.: (PolyLog(s, 4) - zeta(s))/3. - Ilya Gutkovskiy, Jun 26 2016
A000120(a(n)) = n. - André Dalwigk, Mar 26 2018
a(m) divides a(m*n), in particular: a(2*n) == 0 (mod 5), a(3*n) == 0 (mod 3*7), a(5*n) == 0 (mod 11*31), etc. - M. F. Hasler, Oct 19 2018
a(n) = 4^(n-1) + a(n-1). - Bob Selcoe, Jan 01 2020
a(n) = A178415(1, n) = A347834(1, n-1), arrays, for n >= 1. - Wolfdieter Lang, Nov 29 2021
a(n) = A000225(2*n)/3. - John Keith, Jan 22 2022
a(n) = A080674(n) + 1 = A047849(n) - 1 = A163834(n) - 2 = A155701(n) - 3 = A163868(n) - 4 = A156605(n) - 7. - Ray Chandler, Jun 16 2023
From Peter Bala, Jul 23 2025: (Start)
The following are examples of telescoping products. Cf. A016153:
Product_{k = 1..2*n} 1 + 2^k/a(k+1) = a(n+1)/A007583(n) = (4^(n+1) - 1)/(2*4^n + 1).
Hence, Product_{k >= 1} 1 + 2^k/a(k+1) = 2.
Product_{k >= 1} 1 - 2^k/a(k+1) = 2/5, since 1 - 2^n/a(n+1) = b(n)/b(n-1), where b(n) = 2 - 3/(1 - 2^(n+1)).
Product_{k >= 1} 1 + (-2)^k/a(k+1) = 2/3, since 1 + (-2)^n/a(n+1) = c(n)/c(n-1), where c(n) = 2 - 1/(1 + (-2)^(n+1)).
Product_{k >= 1} 1 - (-2)^k/a(k+1) = 6/5, since 1 - (-2)^n/a(n+1) = d(n)/d(n-1), where d(n) = 2 - 1/(1 - (-2)^(n+1)). (End)

A036556 Integers which when multiplied by 3 have an odd number of 1's in their binary expansion (cf. A000069).

Original entry on oeis.org

7, 14, 23, 27, 28, 29, 31, 39, 46, 54, 56, 57, 58, 62, 71, 78, 87, 91, 92, 93, 95, 103, 107, 108, 109, 111, 112, 113, 114, 115, 116, 117, 119, 123, 124, 125, 127, 135, 142, 151, 155, 156, 157, 159, 167, 174, 182, 184, 185, 186, 190, 199, 206, 214
Offset: 1

Views

Author

Dan Hoey

Keywords

Comments

In other words, numbers n such that 3n is odious.
Numbers n such that valuation(binomial(3n,n),2) is odd. - Benoit Cloitre, Jun 06 2004
Intersection of A000069 and A008585 (multiples of 3), divided by 3.

Links

Crossrefs

Cf. A000069, A036555, A036557, A180963.

Programs

  • Magma
    [ n : n in [0..150] | IsOdd(&+Intseq(3*n, 2))]; // Vincenzo Librandi, Apr 13 2011
  • Mathematica
    Select[ Range[ 214 ], OddQ[ Plus@@IntegerDigits[ 3#, 2 ]]& ]
  • PARI
    for(n=1,214,if(valuation(binomial(3*n,n),2)%2==1,print1(n,","))) \\ Benoit Cloitre, Jun 06 2004

Formula

a(n) = A180963(n)/3. - Amiram Eldar, Aug 06 2023

Extensions

Definition corrected by N. J. A. Sloane, Jan 09 2007

A134660 Number of odd coefficients in (1 + x + x^2 + x^3)^n.

Original entry on oeis.org

1, 4, 4, 4, 4, 16, 4, 8, 4, 16, 16, 4, 4, 16, 8, 16, 4, 16, 16, 16, 16, 64, 4, 8, 4, 16, 16, 8, 8, 32, 16, 32, 4, 16, 16, 16, 16, 64, 16, 32, 16, 64, 64, 4, 4, 16, 8, 16, 4, 16, 16, 16, 16, 64, 8, 16, 8, 32, 32, 16, 16, 64, 32, 64, 4, 16, 16, 16, 16, 64, 16, 32, 16, 64, 64, 16, 16, 64
Offset: 0

Views

Author

Steven Finch, Jan 25 2008

Keywords

Examples

			From _Omar E. Pol_, Mar 01 2015: (Start)
Written as an irregular triangle in which the row lengths are the terms of A011782, the sequence begins:
1;
4;
4,4;
4,16,4,8;
4,16,16,4,4,16,8,16;
4,16,16,16,16,64,4,8,4,16,16,8,8,32,16,32;
4,16,16,16,16,64,16,32,16,64,64,4,4,16,8,16,4,16,16,16,16,64,8,16,8,32,32,16,16,64,32,64;
...
(End)

Links

Crossrefs

Cf. A000120, A001316, A008287, A036555, A071053.

Programs

  • Maple
    seq(igcd(4^n,binomial(4*n,n)),n=0..77); # Peter Luschny, Nov 08 2011
  • Mathematica
    PolynomialMod[(1+x+x^2+x^3)^n, 2] /. x->1
A036555 = Total /@ IntegerDigits[3 Range[0, 100], 2]; Table[2^A036555[[n]], {n, 1, 20}] (* or *) Table[GCD[4^n, Binomial[4*n, n]], {n, 0, 50}] (* G. C. Greubel, Dec 31 2017 *)
  • PARI
    a(n) = {my(pol= Pol([1,1,1,1], xx)*Mod(1,2)); subst(lift(pol^n), xx, 1);} \\ Michel Marcus, Mar 01 2015
  • PARI
    a(n) = 2^hammingweight(3*n); \\ Joerg Arndt, Mar 10 2015

Formula

a(n) = 2^A036555(n).
a(n) = gcd(4^n, C(4*n, n)). - Peter Luschny, Nov 08 2011

A036557 Number of multiples of 3 in 0..2^n-1 with an even sum of base-2 digits.

Original entry on oeis.org

1, 1, 2, 3, 6, 10, 20, 35, 70, 126, 252, 463, 926, 1730, 3460, 6555, 13110, 25126, 50252, 97223, 194446, 379050, 758100, 1486675, 2973350, 5858126, 11716252, 23166783, 46333566, 91869970, 183739940, 365088395, 730176790
Offset: 0

Views

Author

Dan Hoey

Keywords

Links

Crossrefs

Cf. A036555, A036556.

Programs

  • Magma
    I:=[1,2,3,6,10]; [1] cat [n le 5 select I[n] else 2*Self(n-1) + 4*Self(n-2) - 8*Self(n-3) - 3*Self(n-4) + 6*Self(n-5): n in [1..30]]; // G. C. Greubel, Dec 31 2017
  • Mathematica
    Sum[ Sum[ Binomial[ Floor[ n/2 ], i ], {i, r, n, 6} ]*Sum[ Binomial[ Ceiling[ n/2 ], i ], {i, r, n, 6} ], {r, 0, 5} ]
Join[{1}, LinearRecurrence[{2, 4, -8, -3, 6}, {1, 2, 3, 6, 10}, 50]] (* G. C. Greubel, Dec 31 2017 *)
  • PARI
    x='x+O('x^30); Vec((1-x-4*x^2+3*x^3+3*x^4-x^5)/((1-x^2)*(1-2*x)*(1-3*x^2))) \\ G. C. Greubel, Dec 31 2017

Formula

From Ralf Stephan, Aug 29 2004: (Start)
a(n) = (1/12)*(3^((n+1)/2) + 3^((n+2)/2) + 2^(n+1) + (-1)^n + 3), n > 0.
G.f.: (1 - x - 4*x^2 + 3*x^3 + 3*x^4 - x^5)/((1-x^2)*(1-2*x)*(1-3*x^2)). (End)
a(n) = 2*a(n-1) + 4*a(n-2) - 8*a(n-3) - 3*a(n-4) + 6*a(n-5). - Wesley Ivan Hurt, Apr 13 2021

A099033 a(n) = Sum_{k=1..n} (-1)^A000120(3*k).

Original entry on oeis.org

1, 2, 3, 4, 5, 6, 5, 6, 7, 8, 9, 10, 11, 10, 11, 12, 13, 14, 15, 16, 17, 18, 17, 18, 19, 20, 19, 18, 17, 18, 17, 18, 19, 20, 21, 22, 23, 24, 23, 24, 25, 26, 27, 28, 29, 28, 29, 30, 31, 32, 33, 34, 35, 34, 35, 34, 33, 32, 33, 34, 35, 34, 35, 36, 37, 38, 39, 40, 41, 42, 41, 42
Offset: 1

Views

Author

Ralf Stephan, Sep 27 2004

Keywords

Comments

a(n) is of order n^log4(3).

Links

Crossrefs

Cf. A000120, A036555.

Programs

  • Mathematica
    A036555 := Total /@ IntegerDigits[3 Range[1, 130], 2]; Table[Sum[ (-1)^A036555[[k]], {k, 1, n}], {n, 1, 50}] (* G. C. Greubel, Jan 01 2017 *)
  • PARI
    a(n) = sum(k=1, n, (-1)^hammingweight(3*k)); \\ Michel Marcus, Dec 03 2016

Extensions

Typo in name corrected by Michel Marcus, Dec 03 2016

A190944 Multiples of 3 written in base 2.

Original entry on oeis.org

0, 11, 110, 1001, 1100, 1111, 10010, 10101, 11000, 11011, 11110, 100001, 100100, 100111, 101010, 101101, 110000, 110011, 110110, 111001, 111100, 111111, 1000010, 1000101, 1001000, 1001011, 1001110, 1010001, 1010100, 1010111, 1011010, 1011101, 1100000
Offset: 0

Views

Author

N. J. A. Sloane, May 24 2011

Keywords

Links

Crossrefs

Cf. A002275, A002450, A007088, A008585, A036555.

Programs

  • Haskell
    a190944 = a007088 . (* 3)  -- Reinhard Zumkeller, Sep 01 2013
  • Magma
    [Seqint(Intseq(n, 2)): n in [0..90 by 3]];  // Bruno Berselli, May 25 2011
  • Maple
    A190944 := proc(n) local b: if(n=0)then return 0: fi: b:=convert(3*n,base,2); return op(convert(b,base,10,10^nops(b))): end: seq(A190944(n),n=0..40); # Nathaniel Johnston, May 25 2011
  • Mathematica
    FromDigits /@ IntegerDigits[Range[0, 99, 3], 2] (* Jean-François Alcover, May 09 2017 *)
  • PARI
    a(n) = fromdigits(binary(3*n), 10); \\ Michel Marcus, Oct 25 2017

Formula

a(n) = A007088(A008585(n)). - Reinhard Zumkeller, Sep 01 2013
a(A002450(n)) = A002275(2n) = R_{2n}. - Bernard Schott, May 04 2021

Extensions

More terms from Bruno Berselli, May 25 2011

A087298 Exponent of 2 in the prime factorization of (3n)!.

Original entry on oeis.org

1, 4, 7, 10, 11, 16, 18, 22, 23, 26, 31, 34, 35, 39, 41, 46, 47, 50, 53, 56, 57, 64, 66, 70, 71, 74, 78, 81, 82, 86, 88, 94, 95, 98, 101, 104, 105, 110, 112, 116, 117, 120, 127, 130, 131, 135, 137, 142, 143, 146, 149, 152, 153, 159, 161, 165, 166
Offset: 1

Views

Author

Ralf Stephan, Oct 20 2003

Keywords

Examples

			(3*5)! = 2^11 * 638512875, so a(5) = 11.

Links

Crossrefs

Cf. A011371 (n!), A005187 ((2n)!), A036555.

Programs

  • Mathematica
    a[n_] := 3*n - DigitCount[3*n, 2, 1]; Array[a, 100] (* Amiram Eldar, Sep 01 2024 *)
  • PARI
    a(n)=valuation((3*n)!,2)

Formula

a(2n) = a(n) + 3n.
a(n) = Sum_{k>=1} floor(3n/2^k).
a(n) = A011371(3*n) = 3*n - A036555(n). - Amiram Eldar, Sep 01 2024
Showing 1-7 of 7 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.