A279511 -id:A279511 - cp's OEIS frontend

A000351 Powers of 5: a(n) = 5^n.

1, 5, 25, 125, 625, 3125, 15625, 78125, 390625, 1953125, 9765625, 48828125, 244140625, 1220703125, 6103515625, 30517578125, 152587890625, 762939453125, 3814697265625, 19073486328125, 95367431640625, 476837158203125, 2384185791015625, 11920928955078125

Offset: 0

N. J. A. Sloane

Same as Pisot sequences E(1, 5), L(1, 5), P(1, 5), T(1, 5). Essentially same as Pisot sequences E(5, 25), L(5, 25), P(5, 25), T(5, 25). See A008776 for definitions of Pisot sequences.
a(n) has leading digit 1 if and only if n = A067497 - 1. - Lekraj Beedassy, Jul 09 2002
With interpolated zeros 0, 1, 0, 5, 0, 25, ... (g.f.: x/(1 - 5*x^2)) second inverse binomial transform of Fibonacci(3n)/Fibonacci(3) (A001076). Binomial transform is A085449. - Paul Barry, Mar 14 2004
Sums of rows of the triangles in A013620 and A038220. - Reinhard Zumkeller, May 14 2006
Sum of coefficients of expansion of (1 + x + x^2 + x^3 + x^4)^n. a(n) is number of compositions of natural numbers into n parts less than 5. a(2) = 25 there are 25 compositions of natural numbers into 2 parts less than 5. - Adi Dani, Jun 22 2011
The compositions of n in which each natural number is colored by one of p different colors are called p-colored compositions of n. For n >= 1, a(n) equals the number of 5-colored compositions of n such that no adjacent parts have the same color. - Milan Janjic, Nov 17 2011
Numbers n such that sigma(5n) = 5n + sigma(n). In fact we have this theorem: p is a prime if and only if all solutions of the equation sigma(p*x) = p*x + sigma(x) are powers of p. - Jahangeer Kholdi, Nov 23 2013
From Doug Bell, Jun 22 2015: (Start)
Empirical observation: Where n is an odd multiple of 3, let x = (a(n) + 1)/9 and let y be the decimal expansion of x/a(n); then y*(x+1)/x + 1 = y rotated to the left.
Example:
  a(3) = 125;
  x = (125 + 1)/9 = 14;
  y = 112, which is the decimal expansion of 14/125 = 0.112;
  112*(14 + 1)/14 + 1 = 121 = 112 rotated to the left.
(End)
a(n) is the number of n-digit integers that contain only odd digits (A014261). - Bernard Schott, Nov 12 2022
Number of pyramids in the Sierpinski fractal square-based pyramid at the n-th step, while A279511 gives the corresponding number of vertices (see IREM link with drawings). - Bernard Schott, Nov 29 2022

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).

T. D. Noe, Table of n, a(n) for n=0..100
O. M. Cain, The Exceptional Selfcondensability of Powers of Five, arXiv:1910.13829 [math.HO], 2019.
Peter J. Cameron, Sequences realized by oligomorphic permutation groups, J. Integ. Seqs. Vol. 3 (2000), #00.1.5.
INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 270
IREM Paris-Nord, La pyramide de Sierpinski (in French).
Tanya Khovanova, Recursive Sequences
Simon Plouffe, Approximations de séries génératrices et quelques conjectures, Dissertation, Université du Québec à Montréal, 1992; arXiv:0911.4975 [math.NT], 2009.
Simon Plouffe, 1031 Generating Functions, Appendix to Thesis, Montreal, 1992
Yash Puri and Thomas Ward, Arithmetic and growth of periodic orbits, J. Integer Seqs., Vol. 4 (2001), #01.2.1.
Eric Weisstein's World of Mathematics, Box Fractal
Index entries for linear recurrences with constant coefficients, signature (5).

Cf. A009969 (even bisection), A013710 (odd bisection), A005054 (first differences), A003463 (partial sums).
Cf. A006495, A006496, A159991, A001021.
Cf. A001076, A008776, A013620, A038220, A067497, A085449, A014261.
Sierpinski fractal square-based pyramid: A020858 (Hausdorff dimension), A279511 (number of vertices), this sequence (number of pyramids).

a000351 = (5 ^)
a000351_list = iterate (* 5) 1  -- Reinhard Zumkeller, Oct 31 2012

[5^n : n in [0..30]]; // Wesley Ivan Hurt, Sep 27 2016

[ seq(5^n,n=0..30) ];
A000351:=-1/(-1+5*z); # Simon Plouffe in his 1992 dissertation

Table[5^n, {n, 0, 30}] (* Stefan Steinerberger, Apr 06 2006 *)
5^Range[0, 30] (* Harvey P. Dale, Aug 22 2011 *)

makelist(5^n,n,0,20); /* Martin Ettl, Dec 27 2012 */

a(n)=5^n \\ Charles R Greathouse IV, Jun 10 2011

def a(n): return 5**n
print([a(n) for n in range(24)]) # Michael S. Branicky, Nov 12 2022

(List.fill(50)(5: BigInt)).scanLeft(1: BigInt)( * ) // Alonso del Arte, May 31 2019

a(n) = 5^n.
a(0) = 1; a(n) = 5*a(n-1) for n > 0.
G.f.: 1/(1 - 5*x).
E.g.f.: exp(5*x).
a(n) = A006495(n)^2 + A006496(n)^2.
a(n) = A159991(n) / A001021(n). - Reinhard Zumkeller, May 02 2009
From Bernard Schott, Nov 12 2022: (Start)
Sum_{n>=0} 1/a(n) = 5/4.
Sum_{n>=0} (-1)^n/a(n) = 5/6. (End)
a(n) = Sum_{k=0..n} C(2*n+1,n-k)*A000045(2*k+1). - Vladimir Kruchinin, Jan 14 2025

A020858 Decimal expansion of log_2(5).

Original entry on oeis.org

2, 3, 2, 1, 9, 2, 8, 0, 9, 4, 8, 8, 7, 3, 6, 2, 3, 4, 7, 8, 7, 0, 3, 1, 9, 4, 2, 9, 4, 8, 9, 3, 9, 0, 1, 7, 5, 8, 6, 4, 8, 3, 1, 3, 9, 3, 0, 2, 4, 5, 8, 0, 6, 1, 2, 0, 5, 4, 7, 5, 6, 3, 9, 5, 8, 1, 5, 9, 3, 4, 7, 7, 6, 6, 0, 8, 6, 2, 5, 2, 1, 5, 8, 5, 0, 1, 3, 9, 7, 4, 3, 3, 5, 9, 3, 7, 0, 1, 5

Offset: 1

N. J. A. Sloane

Equals the Hausdorff dimension of the Sierpinski fractal square-based pyramid, when each square-based pyramid is replaced by 5 half-size such square-based pyramids (see IREM link). - Bernard Schott, Nov 30 2022

			2.3219280...

Vincenzo Librandi, Table of n, a(n) for n = 1..1000
IREM Paris-Nord, La pyramide de Sierpinski (in French).
Wikipedia, List of fractals by Hausdorff dimension (see Fractal pyramid).
Index entries for transcendental numbers

Cf. decimal expansion of log_2(m): A020857 (m=3), this sequence, A020859 (m=6), A020860 (m=7), A020861 (m=9), A020862 (m=10), A020863 (m=11), A020864 (m=12), A152590 (m=13), A154462 (m=14), A154540 (m=15), A154847 (m=17), A154905 (m=18), A154995 (m=19), A155172 (m=20), A155536 (m=21), A155693 (m=22), A155793 (m=23), A155921 (m=24).

Sierpinski pyramid: A000351 (number of pyramids), A279511 (number of vertices).

RealDigits[Log[2,5],10,120][[1]] (* Harvey P. Dale, Oct 20 2011 *)

log(5)/log(2) \\ Charles R Greathouse IV, Aug 06 2020

Definition improved by J. Lowell, May 03 2014

A279512 Sierpinski octahedron numbers a(n) = 26^n + 32^n + 1.

Original entry on oeis.org

6, 19, 85, 457, 2641, 15649, 93505, 560257, 3360001, 20156929, 120935425, 725600257, 4353576961, 26121412609, 156728377345, 940370067457, 5642220011521, 33853319282689, 203119914123265, 1218719481593857, 7312316883271681, 43873901287047169, 263243407697117185

Offset: 0

Steven Beard, Dec 14 2016

Sierpinski recursion applied to octahedron. Cf. A279511 for square pyramids.

Colin Barker, Table of n, a(n) for n = 0..1000
Wikipedia, Octahedron flake and Sierpinski tetrahedron.
Index entries for linear recurrences with constant coefficients, signature (9,-20,12).

Cf. A005900, A047999, A279511.

LinearRecurrence[{9, -20, 12}, {6, 19, 85}, 50] (* or *) Table[2*6^n + 3*2^n + 1, {n,0,50}] (* G. C. Greubel, Dec 22 2016 *)

Vec((6 - 35*x + 34*x^2) / ((1 - x)*(1 - 2*x)*(1 - 6*x)) + O(x^30)) \\ Colin Barker, Dec 15 2016

def a(n): return 2*6**n + 3*2**n + 1
print([a(n) for n in range(23)]) # Michael S. Branicky, Jun 19 2021

a(n) = 3*2^n + 2^(n+1)*3^n + 1.
a(n) = 6a(n-1) - 6(2^n+1) + 1.
a(n) = 6a(n-1) - (3*2^(n+1) + 5).
a(n) = 2*6^n + 3*2^n + 1.
From Colin Barker, Dec 15 2016: (Start)
a(n) = 9*a(n-1) - 20*a(n-2) + 12*a(n-3) for n>2.
G.f.: (6 - 35*x + 34*x^2) / ((1 - x)*(1 - 2*x)*(1 - 6*x)).
(End)

Incorrect terms corrected by Colin Barker, Dec 15 2016

A283070 Sierpinski tetrahedron or tetrix numbers: a(n) = 2*4^n + 2.

Original entry on oeis.org

4, 10, 34, 130, 514, 2050, 8194, 32770, 131074, 524290, 2097154, 8388610, 33554434, 134217730, 536870914, 2147483650, 8589934594, 34359738370, 137438953474, 549755813890, 2199023255554, 8796093022210, 35184372088834, 140737488355330, 562949953421314

Offset: 0

Peter M. Chema, Feb 28 2017

Number of vertices required to make a Sierpinski tetrahedron or tetrix of side length 2^n. The sum of the vertices (balls) plus line segments (rods) of one tetrix equals the vertices of its larger, adjacent iteration. See formula.
Equivalently, the number of vertices in the (n+1)-Sierpinski tetrahedron graph. - Eric W. Weisstein, Aug 17 2017
Also the independence number of the (n+2)-Sierpinski tetrahedron graph. - Eric W. Weisstein, Aug 29 2021
Final digit alternates 4 and 0.

Colin Barker, Table of n, a(n) for n = 0..1000
Eric Weisstein's World of Mathematics, Independence Number
Eric Weisstein's World of Mathematics, Sierpinski Tetrahedron Graph
Eric Weisstein's World of Mathematics, Tetrix
Eric Weisstein's World of Mathematics, Vertex Count
Index entries for linear recurrences with constant coefficients, signature (5,-4).

Subsequence of A016957.
Cf. A052539, A279511, A279512.
First bisection of A052548, A087288; second bisection of A049332, A133140, A135440.
Cf. A002023 (edge count).

Table[2 4^n + 2, {n, 0, 30}] (* Bruno Berselli, Feb 28 2017 *)
2 (4^Range[0, 20] + 1) (* Eric W. Weisstein, Aug 17 2017 *)
LinearRecurrence[{5, -4}, {4, 10}, 20] (* Eric W. Weisstein, Aug 17 2017 *)
CoefficientList[Series[-((2 (-2 + 5 x))/(1 - 5 x + 4 x^2)), {x, 0, 20}], x] (* Eric W. Weisstein, Aug 17 2017 *)

a(n)=2*4^n+2 \\ Charles R Greathouse IV, Feb 28 2017

Vec(2*(2 - 5*x) / ((1 - x)*(1 - 4*x)) + O(x^30)) \\ Colin Barker, Mar 02 2017

def a(n): return 2*4**n + 2
print([a(n) for n in range(25)]) # Michael S. Branicky, Aug 29 2021

G.f.: 2*(2 - 5*x)/((1 - x)*(1 - 4*x)).
a(n) = 5*a(n-1) - 4*a(n-2) for n > 1.
a(n+1) = a(n) + A002023(n).
a(n) = 2*A052539(n) = A188161(n) - 1 = A087289(n) + 1 = A056469(2*n+2) = A261723(4*n+1).
E.g.f.: 2*(exp(4*x) + exp(x)). - G. C. Greubel, Aug 17 2017

Entry revised by Editors of OEIS, Mar 01 2017

A281698 a(n) = 52^(n-1) + 2^(2n-1) + 6^n + 1.

Original entry on oeis.org

5, 14, 55, 269, 1465, 8369, 48865, 288449, 1713025, 10210049, 60993025, 364899329, 2185181185, 13094268929, 78498422785, 470721937409, 2823257554945, 16935249707009, 101594317062145, 609497180274689, 3656708198498305, 21939149668876289, 131630499945775105

Offset: 0

Steven Beard, Jan 27 2017

Similar to A279511 Sierpinski square-based pyramid but with tetrahedral openings as found in the structure of the Sierpinski octahedron A279512.

Colin Barker, Table of n, a(n) for n = 0..1000
Wikipedia, Sierpinski triangle, see section on higher dimensional analogs.
Index entries for linear recurrences with constant coefficients, signature (13,-56,92,-48).

Cf. A000330, A047999, A279511, A279512.

A281698:=n->5*2^(n-1) + 2^(2*n-1) + 6^n + 1: seq(A281698(n), n=0..30); # Wesley Ivan Hurt, Apr 09 2017

Table[5*2^(n - 1) + 2^(2 n - 1) + 6^n + 1, {n, 0, 22}] (* or *)
LinearRecurrence[{13, -56, 92, -48}, {5, 14, 55, 269}, 23] (* or *)
CoefficientList[Series[(5 - 51 x + 153 x^2 - 122 x^3)/((1 - x) (1 - 2 x) (1 - 4 x) (1 - 6 x)), {x, 0, 22}], x] (* Michael De Vlieger, Jan 28 2017 *)

Vec((5 - 51*x + 153*x^2 - 122*x^3) / ((1 - x)*(1 - 2*x)*(1 - 4*x)*(1 - 6*x)) + O(x^30)) \\ Colin Barker, Jan 28 2017

a(n) = 5*2^(n-1) + 2^(2*n-1) + 6^n + 1 \\ Charles R Greathouse IV, Jan 29 2017

From Colin Barker, Jan 28 2017: (Start)
a(n) = 13*a(n-1) - 56*a(n-2) + 92*a(n-3) - 48*a(n-4) for n>3.
G.f.: (5 - 51*x + 153*x^2 - 122*x^3) / ((1 - x)*(1 - 2*x)*(1 - 4*x)*(1 - 6*x)).
(End)

A281699 Sierpinski stellated octahedron numbers: a(n) = 2(-32^(n+1) + 2^(2n+3) + 5).

Original entry on oeis.org

14, 50, 218, 938, 3914, 16010, 64778, 260618, 1045514, 4188170, 16764938, 67084298, 268386314, 1073643530, 4294770698, 17179475978, 68718690314, 274876334090, 1099508482058, 4398040219658, 17592173461514, 70368719011850, 281474926379018, 1125899806179338, 4503599426043914, 18014398106828810

Offset: 0

Steven Beard, Jan 27 2017

Stella octangula with Sierpinski recursion.

Colin Barker, Table of n, a(n) for n = 0..1000
Wikipedia, Sierpinski triangle, see section on higher dimensional analogs.
Index entries for linear recurrences with constant coefficients, signature (7,-14,8).

Cf. A007588, A027693, A052539, A052548, A067771, A178789, A233774, A279511.

Table[8 (2^(2 n + 1) + 2) - 6 (2^(n + 1) + 1), {n, 0, 25}] (* or *)
LinearRecurrence[{7, -14, 8}, {14, 50, 218}, 26] (* or *)
CoefficientList[Series[2 (7 - 24 x + 32 x^2)/((1 - x) (1 - 2 x) (1 - 4 x)), {x, 0, 25}], x] (* Michael De Vlieger, Jan 28 2017 *)

Vec(2*(7 - 24*x + 32*x^2) / ((1 - x)*(1 - 2*x)*(1 - 4*x)) + O(x^30)) \\ Colin Barker, Jan 28 2017

a(n) = 16*4^n - 12*2^n + 10 \\ Charles R Greathouse IV, Jan 29 2017

a(n) = 8*(2^(2*n+1)+2) - 6*(2^(n+1)+1).
From Colin Barker, Jan 28 2017: (Start)
a(n) = 7*a(n-1) - 14*a(n-2) + 8*a(n-3) for n>2.
G.f.: 2*(7 - 24*x + 32*x^2) / ((1 - x)*(1 - 2*x)*(1 - 4*x)).
(End)

A289999 Sierpinski cuboctahedral numbers: a(n) = 164^n - 122^n + 9.

Original entry on oeis.org

13, 49, 217, 937, 3913, 16009, 64777, 260617, 1045513, 4188169, 16764937, 67084297, 268386313, 1073643529, 4294770697, 17179475977, 68718690313, 274876334089, 1099508482057, 4398040219657, 17592173461513, 70368719011849, 281474926379017, 1125899806179337, 4503599426043913, 18014398106828809

Offset: 0

Steven Beard, Sep 03 2017

Sierpinski cuboctahedron constructed by joining eight Sierpinski tetrahedra of sequence 4, 10, 34, 130, 514, 2050, 8194... (4^n*2)+2 (the double of A052539). This sequence is also Sierpinski recursion for the octahemioctahedron A274974.

Colin Barker, Table of n, a(n) for n = 0..1000
Wikipedia, Sierpinski tetrahedron.
Index entries for linear recurrences with constant coefficients, signature (7,-14,8).

Cf. A005902, A290396, A274974, A281699, A067771, A279511.

CoefficientList[Series[(13 - 42 x + 56 x^2)/((1 - x) (1 - 2 x) (1 - 4 x)), {x, 0, 25}], x] (* Michael De Vlieger, Sep 03 2017 *)
Table[16*4^n-12*2^n+9,{n,0,30}] (* or *) LinearRecurrence[{7,-14,8},{13,49,217},30] (* Harvey P. Dale, Dec 31 2018 *)

Vec((13 - 42*x + 56*x^2) / ((1 - x)*(1 - 2*x)*(1 - 4*x)) + O(x^30)) \\ Colin Barker, Sep 03 2017

a(n) = 16*4^n - 12*2^n + 9 \\ Charles R Greathouse IV, Nov 03 2017

a(n) = -3*2^(n + 2) + 2^(2n + 4) + 9.
From Colin Barker, Sep 03 2017: (Start)
G.f.: (13 - 42*x + 56*x^2) / ((1 - x)*(1 - 2*x)*(1 - 4*x)).
a(n) = 7*a(n-1) - 14*a(n-2) + 8*a(n-3) for n>2.
(End)

cp's OEIS Frontend

A000351 Powers of 5: a(n) = 5^n.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Haskell

Magma

Maple

Mathematica

Maxima

PARI

Python

Scala

Formula

A020858 Decimal expansion of log_2(5).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Extensions

A279512 Sierpinski octahedron numbers a(n) = 2*6^n + 3*2^n + 1.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

PARI

Python

Formula

Extensions

A283070 Sierpinski tetrahedron or tetrix numbers: a(n) = 2*4^n + 2.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

PARI

PARI

Python

Formula

Extensions

A281698 a(n) = 5*2^(n-1) + 2^(2*n-1) + 6^n + 1.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Maple

Mathematica

PARI

PARI

Formula

A281699 Sierpinski stellated octahedron numbers: a(n) = 2*(-3*2^(n+1) + 2^(2n+3) + 5).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

A279512 Sierpinski octahedron numbers a(n) = 26^n + 32^n + 1.

A281698 a(n) = 52^(n-1) + 2^(2n-1) + 6^n + 1.

A281699 Sierpinski stellated octahedron numbers: a(n) = 2(-32^(n+1) + 2^(2n+3) + 5).

A289999 Sierpinski cuboctahedral numbers: a(n) = 164^n - 122^n + 9.