A109134 -id:A109134 - cp's OEIS frontend

A060006 Decimal expansion of real root of x^3 - x - 1 (the plastic constant).

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

Offset: 1

Fabian Rothelius, Mar 14 2001

Has been also called the silver number, also the plastic number.
This is the smallest Pisot-Vijayaraghavan number.
The name "plastic number" goes back to the Dutch Benedictine monk and architect Dom Hans van der Laan, who gave this name 4 years after the discovery of the number by the French engineer Gérard Cordonnier in 1924, who used the name "radiant number". - Hugo Pfoertner, Oct 07 2018
Sometimes denoted by the symbol rho. - Ed Pegg Jr, Feb 01 2019
Also the solution of 1/x + 1/(1+x+x^2) = 1. - Clark Kimberling, Jan 02 2020
Given any complex p such that real(p)>-1, this constant is the only real solution of the equation z^p+z^(p+1)=z^(p+3), and the only attractor of the complex mapping z->M(z,p), where M(z,p)=(z^p+z^(p+1))^(1/(p+3)), convergent from any complex plane point. - Stanislav Sykora, Oct 14 2021
The Pisot-Vijayaraghavan numbers were named after the French mathematician Charles Pisot (1910-1984) and the Indian mathematician Tirukkannapuram Vijayaraghavan (1902-1955). - Amiram Eldar, Apr 02 2022
The sequence a(n) = v_3^floor(n^2/4) where v_n is the smallest, positive, real solution to the equation (v_n)^n = v_n + 1 satisfies the Somos-5 recursion a(n+3)*a(n-2) = a(n+2)*a(n-1) + a(n+1)*a(n) for all n in Z. Also true if floor is removed. - Michael Somos, Mar 24 2023

			1.32471795724474602596090885447809734...

Steven R. Finch, Mathematical Constants, Cambridge, 2003, Section 1.2.2.
Midhat J. Gazalé, Gnomon: From Pharaohs to Fractals, Princeton University Press, Princeton, NJ, 1999, see Chap. VII.
Donald E. Knuth, The Art of Computer Programming, Vol. 4A, Section 7.1.4, p. 236.
Ian Stewart, A Guide to Computer Dating (Feedback), Scientific American, Vol. 275 No. 5, November 1996, p. 118.

Harry J. Smith, Table of n, a(n) for n = 1..20000
Alex Bellos, The golden ratio has spawned a beautiful new curve: the Harriss spiral, The Guardian, Jan 13 2015.
Gamaliel Cerda-Morales, New Identities for Padovan Numbers, arXiv:1904.05492 [math.CO], 2019.
Brady Haran and Edmund Harriss, The Plastic Ratio, Numberphile video (2019).
Ed Pegg Jr., Pictures based on the plastic constant
Simon Plouffe, Smallest Pisot-Vijayaraghavan number to 50000 digits
Simon Plouffe, The Smallest Pisot-Vijayaraghavan number
F. Rothelius, Formulae.
Ian Stewart, Tales of a Neglected Number, Mathematical Recreations, Scientific American, Vol. 274, No. 6 (1996), pp. 102-103.
Ian Stewart, Tales of a Neglected Number, Mathematical Recreations, Scientific American, Vol. 274, No. 6 (1996), pp. 102-103.
Dom Hans van der Laan, Le nombre plastique: Quinze leçons sur l’ordonnance architectonique, Brill Academic Pub., Leiden, 1960.
Michel Waldschmidt, Lectures on Multiple Zeta Values, IMSC 2011.
Eric Weisstein's World of Mathematics, Maverick Graph.
Eric Weisstein's World of Mathematics, Pisot Number.
Eric Weisstein's World of Mathematics, Plastic Constant.
Wikipedia, Plastic number.
Index entries for algebraic numbers, degree 3

Cf. A001622. A072117 gives continued fraction.
Cf. A006888, A010527, A051016, A051017, A084252, A075778 (inverse), A126772.
Other Pisot numbers: A086106, A092526, A228777, A293506, A293508, A293509, A293557.
Cf. A002620, A006721, A134816.

SetDefaultRealField(RealField(100)); ((3+Sqrt(23/3))/6)^(1/3) + ((3-Sqrt(23/3))/6)^(1/3); // G. C. Greubel, Mar 15 2019

(1/2 +sqrt(23/3)/6)^(1/3) + (1/2-sqrt(23/3)/6)^(1/3) ; evalf(%,130) ; # R. J. Mathar, Jan 22 2013

RealDigits[ Solve[x^3 - x - 1 == 0, x][[1, 1, 2]], 10, 111][[1]] (* Robert G. Wilson v, Sep 30 2009 *)
s = Sqrt[23/108]; RealDigits[(1/2 + s)^(1/3) + (1/2 - s)^(1/3), 10, 111][[1]] (* Robert G. Wilson v, Dec 12 2017 *)
RealDigits[Root[x^3-x-1,1],10,120][[1]] (* or *) RealDigits[(Surd[9-Sqrt[69],3]+Surd[9+Sqrt[69],3])/(Surd[2,3]Surd[9,3]),10,120][[1]] (* Harvey P. Dale, Sep 04 2018 *)

allocatemem(932245000); default(realprecision, 20080); x=solve(x=1, 2, x^3 - x - 1); for (n=1, 20000, d=floor(x); x=(x-d)*10; write("b060006.txt", n, " ", d)); \\ Harry J. Smith, Jul 01 2009

(1/2 +sqrt(23/3)/6)^(1/3) + (1/2-sqrt(23/3)/6)^(1/3) \\ Altug Alkan, Apr 10 2016

polrootsreal(x^3-x-1)[1] \\ Charles R Greathouse IV, Aug 28 2016

default(realprecision, 110); digits(floor(solve(x=1, 2, x^3 - x - 1)*10^105)) /* Michael Somos, Mar 24 2023 */

numerical_approx(((3+sqrt(23/3))/6)^(1/3) + ((3-sqrt(23/3))/6)^(1/3), digits=100) # G. C. Greubel, Mar 15 2019

Equals (1/2+sqrt(23/108))^(1/3) + (1/2-sqrt(23/108))^(1/3). - Henry Bottomley, May 22 2003
Equals CubeRoot(1 + CubeRoot(1 + CubeRoot(1 + CubeRoot(1 + ...)))). - Gerald McGarvey, Nov 26 2004
Equals sqrt(1+1/sqrt(1+1/sqrt(1+1/sqrt(1+...)))). - Gerald McGarvey, Mar 18 2006
Equals (1/2 +sqrt(23/3)/6)^(1/3) + (1/2-sqrt(23/3)/6)^(1/3). - Eric Desbiaux, Oct 17 2008
Equals Sum_{k >= 0} 27^(-k)/k!*(Gamma(2*k+1/3)/(9*Gamma(k+4/3)) - Gamma(2*k-1/3)/(3*Gamma(k+2/3))). - Robert Israel, Jan 13 2015
Equals sqrt(Phi) = sqrt(1.754877666246...) (see A109134). - Philippe Deléham, Sep 29 2020
Equals cosh(arccosh(3*c)/3)/c, where c = sqrt(3)/2 (A010527). - Amiram Eldar, May 15 2021
Equals 1/hypergeom([1/5, 2/5, 3/5, 4/5], [2/4, 3/4, 5/4], -5^5/4^4). - Gerry Martens, Mar 16 2025

Edited and extended by Robert G. Wilson v, Aug 03 2002

Removed incorrect comments, Joerg Arndt, Apr 10 2016

A005314 For n = 0, 1, 2, a(n) = n; thereafter, a(n) = 2*a(n-1) - a(n-2) + a(n-3).

Original entry on oeis.org

0, 1, 2, 3, 5, 9, 16, 28, 49, 86, 151, 265, 465, 816, 1432, 2513, 4410, 7739, 13581, 23833, 41824, 73396, 128801, 226030, 396655, 696081, 1221537, 2143648, 3761840, 6601569, 11584946, 20330163, 35676949, 62608681, 109870576, 192809420, 338356945, 593775046

Offset: 0

N. J. A. Sloane

Number of compositions of n into parts congruent to {1,2} mod 4. - Vladeta Jovovic, Mar 10 2005
a(n)/a(n-1) tends to A109134; an eigenvalue of the matrix M and a root to the characteristic polynomial. - Gary W. Adamson, May 25 2007
Starting with offset 1 = INVERT transform of (1, 1, 0, 0, 1, 1, 0, 0, ...). - Gary W. Adamson, May 04 2009
a(n-2) is the top left entry of the n-th power of the 3 X 3 matrix [0, 1, 0; 0, 1, 1; 1, 0, 1] or of the 3 X 3 matrix [0, 0, 1; 1, 1, 0; 0, 1, 1]. - R. J. Mathar, Feb 03 2014
Counts closed walks of length (n+2) at a vertex of a unidirectional triangle containing a loop on remaining two vertices. - David Neil McGrath, Sep 15 2014
Also the number of binary words of length n that begin with 1 and avoid the subword 101. a(5) = 9: 10000, 10001, 10010, 10011, 11000, 11001, 11100, 11110, 11111. - Alois P. Heinz, Jul 21 2016
Also the number of binary words of length n-1 such that every two consecutive 0s are immediately followed by at least two consecutive 1s. a(4) = 5: 010, 011, 101, 110, 111. - Jerrold Grossman, May 03 2024

			G.f. = x + 2*x^2 + 3*x^3 + 5*x^4 + 9*x^5 + 16*x^6 + 28*x^7 + 49*x^8 + ...
From _Gus Wiseman_, Nov 25 2019: (Start)
a(n) is the number of subsets of {1..n} containing n such that if x and x + 2 are both in the subset, then so is x + 1. For example, the a(1) = 1 through a(5) = 9 subsets are:
  {1}  {2}    {3}      {4}        {5}
       {1,2}  {2,3}    {1,4}      {1,5}
              {1,2,3}  {3,4}      {2,5}
                       {2,3,4}    {4,5}
                       {1,2,3,4}  {1,2,5}
                                  {1,4,5}
                                  {3,4,5}
                                  {2,3,4,5}
                                  {1,2,3,4,5}
(End)

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..400
Isha Agarwal, Matvey Borodin, Aidan Duncan, Kaylee Ji, Tanya Khovanova, Shane Lee, Boyan Litchev, Anshul Rastogi, Garima Rastogi, and Andrew Zhao, From Unequal Chance to a Coin Game Dance: Variants of Penney's Game, arXiv:2006.13002 [math.HO], 2020.
Marilena Barnabei, Flavio Bonetti, Niccolò Castronuovo, and Matteo Silimbani, Permutations avoiding a simsun pattern, The Electronic Journal of Combinatorics (2020) Vol. 27, Issue 3, P3.45.
P. Chinn and S. Heubach, Integer Sequences Related to Compositions without 2's, J. Integer Seqs., Vol. 6, 2003.
Hung Viet Chu and Zachary Louis Vasseur, Schreier Sets of Multiples of an Integer, Linear Recurrence, and Pascal Triangle, arXiv:2506.14312 [math.CO], 2025. See Table 1 p. 2.
Christian Ennis, William Holland, Omer Mujawar, Aadit Narayanan, Frank Neubrander, Marie Neubrander, and Christina Simino, Words in Random Binary Sequences I, arXiv:2107.01029 [math.GM], 2021.
R. L. Graham and N. J. A. Sloane, Anti-Hadamard matrices, Linear Alg. Applic., 62 (1984), 113-137.
Jia Huang, A coin flip game and generalizations of Fibonacci numbers, arXiv:2501.07463 [math.CO], 2025. See pp. 8, 10.
INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 426
L. A. Medina and A. Straub, On multiple and infinite log-concavity, 2013, preprint Annals of Combinatorics, March 2016, Volume 20, Issue 1, pp 125-138.
Denis Neiter and Amsha Proag, Links Between Sums Over Paths in Bernoulli's Triangles and the Fibonacci Numbers, Journal of Integer Sequences, Vol. 19 (2016), Article 16.8.3.
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
Bojan Vučković and Miodrag Živković, Row Space Cardinalities Above 2^(n - 2) + 2^(n - 3), ResearchGate, January 2017, p. 3.
Index entries for linear recurrences with constant coefficients, signature (2,-1,1).

Equals row sums of triangle A099557.
Equals row sums of triangle A224838.
Cf. A011973 (starting with offset 1 = Falling diagonal sums of triangle with rows displayed as centered text).
First differences of A005251, shifted twice to the left.
Cf. A003242, A114901, A261041, A274174.

a005314 n = a005314_list !! n
a005314_list = 0 : 1 : 2 : zipWith (+) a005314_list
   (tail $ zipWith (-) (map (2 *) $ tail a005314_list) a005314_list)
-- Reinhard Zumkeller, Oct 14 2011

[0] cat [n le 3 select n else 2*Self(n-1) - Self(n-2) + Self(n-3):n in [1..35]]; // Marius A. Burtea, Oct 24 2019

R:=PowerSeriesRing(Integers(), 36); [0] cat Coefficients(R!( x/(1-2*x+x^2-x^3))); // Marius A. Burtea, Oct 24 2019

A005314 := proc(n)
    option remember ;
    if n <=2 then
        n;
    else
        2*procname(n-1)-procname(n-2)+procname(n-3) ;
    end if;
end proc:
seq(A005314(n),n=0..20) ; # R. J. Mathar, Feb 25 2024

LinearRecurrence[{2, -1, 1}, {0, 1, 2}, 100] (* Vladimir Joseph Stephan Orlovsky, Jul 03 2011 *)
Table[Sum[Binomial[n - Floor[(k + 1)/2], n - Floor[(3 k - 1)/2]], {k, 0, n}], {n, 0, 100}] (* John Molokach, Jul 21 2013 *)
Table[Sum[Binomial[n - Floor[(4 n + 15 - 6 k + (-1)^k)/12], n - Floor[(4 n + 15 - 6 k + (-1)^k)/12] - Floor[(2 n - 1)/3] + k - 1], {k, 1, Floor[(2 n + 2)/3]}], {n, 0, 100}] (* John Molokach, Jul 25 2013 *)
a[ n_] := If[ n < 0, SeriesCoefficient[ x^2 / (1 - x + 2 x^2 - x^3), {x, 0, -n}], SeriesCoefficient[ x / (1 - 2 x + x^2 - x^3), {x, 0, n}]]; (* Michael Somos, Dec 13 2013 *)
RecurrenceTable[{a[0]==0,a[1]==1,a[2]==2,a[n]==2a[n-1]-a[n-2]+a[n-3]},a,{n,40}] (* Harvey P. Dale, May 13 2018 *)
Table[Length[Select[Subsets[Range[n]],MemberQ[#,n]&&!MatchQ[#,{_,x_,y_,_}/;x+2==y]&]],{n,0,10}] (* Gus Wiseman, Nov 25 2019 *)

{a(n) = sum(k=0, (2*n-1)\3, binomial(n-1-k\2, k))}

{a(n) = if( n<0, polcoeff( x^2 / (1 - x + 2*x^2 - x^3) + x * O(x^-n), -n), polcoeff( x / (1 - 2*x + x^2 - x^3) + x * O(x^n), n))}; /* Michael Somos, Sep 18 2012 */

def A005314(n): return sum( binomial(n-k, 2*k+1) for k in range(floor((n+2)/3)) )
[A005314(n) for n in range(51)] # G. C. Greubel, Nov 10 2023

From Paul D. Hanna, Oct 22 2004: (Start)
G.f.: x/(1-2*x+x^2-x^3).
a(n) = Sum_{k=0..[(2n-1)/3]} binomial(n-1-[k/2], k), where [x]=floor(x). (End)
a(n) = Sum_{k=0..n} binomial(n-k, 2*k+1).
23*a_n = 3*P_{2n+2} + 7*P_{2n+1} - 2*P_{2n}, where P_n are the Perrin numbers, A001608. - Don Knuth, Dec 09 2008
G.f. (1-z)*(1+z^2)/(1-2*z+z^2-z^3) for the augmented version 1, 1, 2, 3, 5, 9, 16, 28, 49, 86, 151, ... was given in Simon Plouffe's thesis of 1992.
a(n) = a(n-1) + a(n-2) + a(n-4) = a(n-2) + A049853(n-1) = a(n-1) + A005251(n) = Sum_{i <= n} A005251(i).
a(n) = Sum_{k=0..floor((n-1)/3)} binomial(n-k, 2*k+1). - Richard L. Ollerton, May 12 2004
M^n*[1,0,0] = [a(n-2), a(n-1), a]; where M = the 3 X 3 matrix [0,1,0; 0,0,1; 1,-1,2]. Example M^5*[1,0,0] = [3,5,9]. - Gary W. Adamson, May 25 2007
a(n) = A000931(2*n + 4). - Michael Somos, Sep 18 2012
a(n) = A077954(-n - 2). - Michael Somos, Sep 18 2012
G.f.: 1/( 1 - Sum_{k>=0} x*(x-x^2+x^3)^k ) - 1. - Joerg Arndt, Sep 30 2012
a(n) = Sum_{k=0..n} binomial( n-floor((k+1)/2), n-floor((3k-1)/2) ). - John Molokach, Jul 21 2013
a(n) = Sum_{k=1..floor((2*n+2)/3)} binomial(n - floor((4*n+15-6*k+(-1)^k)/12), n - floor((4*n+15-6*k+(-1)^k)/12) - floor((2*n-1)/3) + k - 1). - John Molokach, Jul 24 2013
a(n) = round(A001608(2n+1)*r) where r is the real root of 23*x^3 - 23*x^2 + 8*x - 1 = 0, r = 0.4114955... - Richard Turk, Oct 24 2019
a(n+2) = n + 2 + Sum_{k=0..n} (n-k)*a(k). - Greg Dresden and Yichen P. Wang, Sep 16 2021
a(n) ~ (19 - r + 11*r^2) / (23 * r^(n-1)), where r = 0.569840290998... is the root of the equation r*(2 - r + r^2) = 1. - Vaclav Kotesovec, Apr 14 2024
a(n) = n*3F2(1/3-n/3,2/3-n/3,1-n/3;-n,3/2;27/4). - R. J. Mathar, Jun 27 2024
If p,q,r are the three solutions to x^3 = 2x^2 - x + 1, then a(n) = p^(n+1)/((p-q)*(p-r)) + q^(n+1)/((q-p)*(q-r)) + r^(n+1)/((r-p)*(r-q)). Compare to similar formula for A005251. - Greg Dresden and AnXing Yang, Aug 19 2025

More terms and additional formulas from Henry Bottomley, Jul 21 2000

Plouffe's g.f. edited by R. J. Mathar, May 12 2008

A001685 a(0) = 1, a(1) = 2, a(2) = 3; for n >= 3, a(n) = a(n-2) + a(n-1)*Product_{i=1..n-3} a(i).

Original entry on oeis.org

1, 2, 3, 5, 13, 83, 2503, 976253, 31601312113, 2560404986164794683, 202523113189037952478722304798003, 506227391211661106785411233681995783881012463859772443053

Offset: 0

N. J. A. Sloane

nonn

From a continued fraction.

Every term is relatively prime to all others. - Michael Somos, Feb 01 2004

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

John Cerkan, Table of n, a(n) for n = 0..16
V. C. Harris, Another proof of the infinitude of primes, Amer. Math. Monthly, 63 (1956), 711.
R. Mestrovic, Euclid's theorem on the infinitude of primes: a historical survey of its proofs (300 BC--2012) and another new proof, arXiv preprint arXiv:1202.3670 [math.HO], 2012. - From _N. J. A. Sloane_, Jun 13 2012

Cf. A003686, A064526, A109134.

Clear[a]; a[0]=1; a[1]=2; a[2]=3; a[n_]:=a[n] = a[n-2] + a[n-1]*Product[a[j],{j,1,n-3}]; Table[a[n],{n,0,15}] (* Vaclav Kotesovec, May 21 2015 *)
Clear[a];RecurrenceTable[{a[n]==a[n-2]+a[n-1]*a[n-3]*(a[n-1]-a[n-3])/a[n-2],a[0]==1,a[1]==2,a[2]==3},a,{n,0,15}] (* Vaclav Kotesovec, May 21 2015 *)

a(n)=if(n<3,max(0,n+1),a(n-2)+a(n-1)*prod(i=1,n-3,a(i))) /* Michael Somos, Feb 01 2004 */

a(n) = a(n-2) + a(n-1)*a(n-3)*(a(n-1)-a(n-3))/a(n-2). - Vaclav Kotesovec, May 21 2015

a(n) ~ c^(d^n), where d = A109134 = 1.754877666246692760049508896358528691894606617772793143989283970646... is the root of the equation d*(d-1)^2 = 1, c = 1.3081335128180696870655208993764956995000211962454918672885690026423582299... . - Vaclav Kotesovec, May 21 2015

Edited by N. J. A. Sloane, Jun 12 2006

A136444 a(n) = Sum_{k=0..n} kbinomial(n-k, 2k).

Original entry on oeis.org

0, 0, 0, 1, 3, 6, 12, 25, 51, 101, 197, 381, 731, 1392, 2634, 4958, 9290, 17337, 32239, 59760, 110460, 203651, 374593, 687567, 1259597, 2303449, 4205493, 7666560, 13956532, 25374108, 46076436, 83575025, 151431099, 274108826, 495708364, 895670733, 1617003823, 2916984121

Offset: 0

Don Knuth, Apr 04 2008

Consider four related sequences: A_n = sum C(n-k, 2*k), B_n = sum C(n-k, 2*k+1), A^*_n = sum k*C(n-k, 2*k), B^*_n = sum k*C(n-k, 2*k+1).
Sequence A_n, with generating function (1-z)/p(z) where p(z) = 1 - 2*z + z^2 - z^3, is A005251.
Sequence B_n, with generating function z/p(z), is A005314.
Sequence A^*_n is the present sequence.
Sequence B^*_n is A118430, but shifted one place so that the generating function is z^4/p(z)^2 instead of z^3/p(z)^2.
These sequences have many interrelations; for example,
B_{n+1} - B_n = A_n; B^*_{n+1} - B^*_n = A^*_n;
A_{n+1} - A_n = B_{n-1}; A^*{n+1} - A^*_n = B^*{n-1} + B_{n-1}.

D. E. Knuth, The Art of Computer Programming, Vol. 4A, Section 7.1.4.

T. Mansour and M. Shattuck, Counting Peaks and Valleys in a Partition of a Set, J. Int. Seq. 13 (2010), #10.6.8, partitions of [n] with 2 blocks with 1 peak.

Cf. A005251, A005314, A118430, A136445, A137356-A137361.

[&+[k*Binomial(n-k, 2*k): k in [0..n]]: n in [0..40]]; // Bruno Berselli, Feb 13 2015

a:= n-> (Matrix([[0,0,1,1,-3,-5]]). Matrix(6, (i,j)-> if (i=j-1) then 1 elif j=1 then [4,-6,6,-5,2,-1][i] else 0 fi)^n)[1,1]: seq(a(n), n=0..37);  # Alois P. Heinz, Aug 13 2008

a[n_] := ({0, 0, 1, 1, -3, -5} . MatrixPower[ Table[If[i == j-1, 1, If[j == 1, {4, -6, 6, -5, 2, -1}[[i]], 0]], {i, 6}, {j, 6}], n])[[1]]; Table[a[n], {n, 0, 37}] (* Jean-François Alcover, Feb 13 2015, after Alois P. Heinz *)
CoefficientList[Series[x^3 (1 - x)/(1 - 2 x + x^2 - x^3)^2, {x, 0, 40}], x] (* Vincenzo Librandi, Aug 15 2015 *)

G.f.: x^3*(1-x)/(1-2*x+x^2-x^3)^2.

a(n) ~ c * d^n * n, where d = A109134 = 1.75487766624669276... is the root of the equation d*(d-1)^2 = 1, c = 0.072838349685011... is the root of the equation 529*c^3 - 207*c^2 + 26*c = 1. - Vaclav Kotesovec, May 25 2015

A181532 a(0) = 0, a(1) = 1, a(2) = 1, a(3) = 2; a(n) = a(n-1) + a(n-2) + a(n-4).

Original entry on oeis.org

0, 1, 1, 2, 3, 6, 10, 18, 31, 55, 96, 169, 296, 520, 912, 1601, 2809, 4930, 8651, 15182, 26642, 46754, 82047, 143983, 252672, 443409, 778128, 1365520, 2396320, 4205249, 7379697, 12950466, 22726483, 39882198, 69988378, 122821042, 215535903, 378239143, 663763424

Offset: 0

Gary W. Adamson, Oct 28 2010

Essentially the same as A060945: a(0)=0 and a(n)=A060945(n-1) for n>=1.
lim(n->infinity) a(n+1)/a(n) = A109134 = 1.754877666..., the square of the absolute value of one of the complex-valued roots of the characteristic polynomial. [R. J. Mathar, Nov 01 2010]
The Ze4 sums, see A180662 for the definition of these sums, of the ‘Races with Ties’ triangle A035317 lead to this sequence. [Johannes W. Meijer, Jul 20 2011]

			a(7) = 18 = a(6) + a(5) + a(3) = 10 + 6 + 2.
a(7) = 18 = (1 0, 2, 0, 2, 0, 3) dot (10, 6, 3, 2, 1, 1, 1) = (10 + 3 + 2 + 3).

Index entries for linear recurrences with constant coefficients, signature (1,1,0,1). [From _R. J. Mathar_, Oct 29 2010]

All of A060945, A077930, A181532 are variations of the same sequence. - N. J. A. Sloane, Mar 04 2012

LinearRecurrence[{1,1,0,1},{0,1,1,2},40] (* Harvey P. Dale, Jun 20 2015 *)

a(0) = 0, a(1) = 1, a(2) = 1, a(3) = 2; a(n) = a(n-1) + a(n-2) + a(n-4).
G.f.: x/(1-x-x^2-x^4). [Franklin T. Adams-Watters, Feb 25 2011]
a(n) = |A077930(n)| = ( |A056016(n+2)|-(-1)^n)/5. [R. J. Mathar, Oct 29 2010]
a(n) = A060945(n-1), n>1. [R. J. Mathar, Nov 03 2010]

Values from a(9) on changed by R. J. Mathar, Oct 29 2010

Edited and a(0) added by Franklin T. Adams-Watters, Feb 25 2011

A109377 Expansion of ( 2+x+2x^2 ) / ( 1-2x+x^2-x^3 ).

Original entry on oeis.org

2, 5, 10, 17, 29, 51, 90, 158, 277, 486, 853, 1497, 2627, 4610, 8090, 14197, 24914, 43721, 76725, 134643, 236282, 414646, 727653, 1276942, 2240877, 3932465, 6900995, 12110402, 21252274, 37295141, 65448410, 114853953, 201554637, 353703731, 620706778

Offset: 0

Mrs. J. P. Shiwalkar (jyotishiwalkar(AT)rediffmail.com) and Mr. M. N. Deshpande (dpratap_ngp(AT)sancharnet.in), Aug 25 2005

Previous name was: A coin is tossed n times and the resultant strings of H's and T's are arranged in a circular (cyclic) manner (i.e. the outcome of the n-th toss is chained to the outcome of the first toss). Then the above sequence represents the number of strings, out of total possible strings of n tosses (n>1), having no isolated H, (by an isolated H, we mean single 'H' which is preceded and succeeded by a 'T'), when the resultant strings are arranged and studied in circular manner. Illustration: In the following string of 10 tosses, 'HHTHTHTTTH', there are only 2 isolated H's, namely the H's at toss number 4 and 6. whereas in the string 'THTHTHTTTH', there will be 4 isolated H's, namely at toss number 2,4,6 and 10. In the string 'HHTTHHHTTH' there is no isolated H, as the H at the 10th toss when chained to the first toss, will no longer be the isolated H, but a triple H.

W. Just and G. A. Enciso, Ordered Dynamics in Biased and Cooperative Boolean Networks, 2013.
Matthew Macauley, Jon McCammond, and Henning S. Mortveit, Dynamics groups of asynchronous cellular automata, Journal of Algebraic Combinatorics, Vol 33, No 1 (2011), pp. 11-35.
Index entries for linear recurrences with constant coefficients, signature (2,-1,1).

CoefficientList[ Series[(-2 - x - 2*x^2)/(-1 + 2*x - x^2 + x^3), {x, 0, 34}], x] (* Robert G. Wilson v, Jul 10 2013 *)
LinearRecurrence[{2, -1, 1}, {2, 5, 10}, 35] (* Robert G. Wilson v, Jul 10 2013 *)
Table[RootSum[-1 + # - 2 #^2 + #^3 &, #^(n + 2) &], {n, 0, 20}] (* Eric W. Weisstein, Nov 26 2023 *)

If a(k) denotes the k-th term( k>4), of the above sequence then a(k)=2a(k-1)-a(k-2)+a(k-3), with a(2)=2, a(3)=5, a(4)=10. Also the k-th term, a(k)( k>5), of this sequence, can be obtained by the formula, a(k)=a(k-1)+a(k-2)+a(k-4), (previous 4 terms are needed), where a(2)=2, a(3)=5, a(4)=10, a(5)=17.
a(n) = P(2*n + 4) where P is the Perrin sequence (A001608). a(n) is asymptotic to r^(n+2) where r is the real root of x^3 -2*x^2 +x -1 (A109134). For n>2, a(n) = round(r^(n+2)). - Gerald McGarvey, Jan 12 2008
G.f.: ( -2-x-2*x^2 ) / ( -1+2*x-x^2+x^3 ). - R. J. Mathar, Aug 10 2012

Shorter name from Joerg Arndt, Sep 03 2013

A227804 a(1) = greatest k such that H(k) - H(8) < H(8) - H(4); a(2) = greatest k such that H(k) - H(a(1)) < H(a(1)) - H(8), and for n > 2, a(n) = greatest k such that H(k) - H(a(n-1)) > H(a(n-1)) - H(a(n-2)), where H = harmonic number.

Original entry on oeis.org

15, 27, 48, 85, 150, 264, 464, 815, 1431, 2512, 4409, 7738, 13580, 23832, 41823, 73395, 128800, 226029, 396654, 696080, 1221536, 2143647, 3761839, 6601568, 11584945, 20330162, 35676948, 62608680, 109870575, 192809419, 338356944, 593775045, 1042002566

Offset: 1

Clark Kimberling, Jul 31 2013

Suppose that x and y are positive integers and that x <=y. Let c(1) = y and c(2) = greatest k such that H(k) - H(y) < H(y) - H(x); for n > 2, let c(n) = greatest such that H(k) - H(c(n-1)) < H(c(n-1)) - H(c(n-2)). Then 1/x + ... + 1/c(1) > 1/(c(1)+1) + ... + 1/(c(2)) > 1/(c(2)+1) + ... + 1/(c(3)) > ... The decreasing sequences H(c(n)) - H(c(n-1)) and c(n)/c(n-1) converge. For what choices of (x,y) is the sequence c(n) linearly recurrent?

For A227804, (x,y) = (5,8); it appears that the sequence a(n) is linearly recurrent with signature (3,-3,2,-1), that H(c(n)) - H(c(n-1)) approaches a limit 0.56239..., and that c(n)/c(n-1) approaches the constant 1.75487... given at A109134.

			The first three values (a(1),a(2),a(3)) = (10,43,179) match the beginning of the following inequality chain (and partition of the harmonic numbers H(n) for n >= 5 ):  1/5 + 1/6 + 1/7 + 1/8 > 1/9 + ... + 1/15 < 1/16 + ... + 1/27 < 1/28 + ... + 1/48 > ...

Clark Kimberling, Table of n, a(n) for n = 1..1000

Cf. A001008, A002805 (numerator and denominator of harmonic numbers).

Cf. A224820, A224868, A227728.

z = 100; h[n_] := h[n] = HarmonicNumber[N[n, 500]]; x = 3; y = 5; a[1] = -1 + Ceiling[w /. FindRoot[h[w] == 2 h[y] - h[x - 1], {w, 1}, WorkingPrecision -> 400]]; a[2] = -1 + Ceiling[w /. FindRoot[h[w] == 2 h[a[1]] - h[y], {w, a[1]}, WorkingPrecision -> 400]]; Do[s = 0; a[t] = -1 + Ceiling[w /. FindRoot[h[w] == 2 h[a[t - 1]] - h[a[t - 2]], {w, a[t - 1]}, WorkingPrecision -> 400]], {t, 3, z}]; m = Map[a, Range[z]] (* A227804, Peter J. C. Moses, Jul 23 2013 *)

a(n) = 3*a(n-1) - 3*a(n-2) + 2*a(n-3) - a(n-4) (conjectured).

G.f.: (15 - 18 x + 12 x^2 - 8 x^3)/(1 - 3 x + 3 x^2 - 2 x^3 + x^4) (conjectured).

A374752 Decimal expansion of phi_4, a limit point of the set of Pisot numbers in (1,2).

Original entry on oeis.org

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

Offset: 1

Paolo Xausa, Jul 18 2024

			1.933184981899520446791424030335631586375183784479...

Paolo Xausa, Table of n, a(n) for n = 1..10000
Jean-Paul Allouche, Christiane Frougny, and Kevin G. Hare, On Univoque Pisot Numbers, Mathematics of Computation, Vol. 76, No. 259, July 2007, pp. 1639-1660 (arXiv version).
Kevin G. Hare and Nikita Sidorov, Conjugates of Pisot numbers, International Journal of Number Theory, Vol. 17, No. 06 (2021), pp. 1307-1321 (arXiv version).
Eric Weisstein's World of Mathematics, Pisot Number.
Wikipedia, Pisot-Vijayaraghavan number.
Index entries for algebraic numbers.

Cf. A001622, A058265, A086088, A109134, A275828, A374751.

First[RealDigits[Root[#^5 - 2*#^4 + # - 1 &, 1], 10, 100]]

Equals the real root of x^5 - 2*x^4 + x - 1.

Using the notation of Hare and Sidorov (2021, see Theorem 3.1), phi_1 = psi_1 (A001622) < phi_2 (A109134) < psi_2 (A058265) < phi_3 (A275828) < chi (A374751) < psi_3 (A086088) < phi_4 (this constant) < ... < psi_r < phi_(r+1) < ... < 2.

A368747 Self-describing bit sequences from the beta transform.

Original entry on oeis.org

0, 1, 2, 3, 4, 6, 7, 8, 10, 12, 13, 14, 15, 16, 20, 24, 25, 26, 28, 29, 30, 31, 32, 36, 40, 42, 48, 49, 50, 52, 53, 54, 56, 57, 58, 59, 60, 61, 62, 63, 64, 72, 80, 82, 84, 96, 97, 98, 100, 101, 104, 105, 106, 108, 109, 112, 113, 114, 115, 116, 117, 118, 120

Offset: 0

Linas Vepstas, Feb 06 2024

nonn

A bit sequence b_0, b_1, ..., b_k of the binary representation of an odd integer 2n+1 is self-describing if the largest real root beta of the monic polynomial p_n(x) = x^(k+1) - b_0 * x^k - b_1 * x^(k-1) - ... - b_k regenerates the same bit sequence when the beta transform t(x) = (beta * x) mod 1 is iterated for x=1, the generated bit being zero or one, depending on whether the modulo was taken or not. Not all integers n generate such self-describing polynomials; the sequence given here begins the list of valid self-describing polynomials.
The number of such valid polynomials of degree m is given by Moreau's necklace counting function A001037.
The bit sequences are not Lyndon words, and cannot be rotated, although there are the same number of them (given by the necklace function).
The bit sequences are not isomorphic to the irreducible polynomials over the field F_2 of two elements, although there are the same number of them (given by the necklace function).

			n=1 generates p_1(x) = x^2 - x - 1 whose largest real root is the golden mean A000045. Iteration of the golden mean under the beta transform terminates after two steps, and requires modulo-one to be applied at each step, thus giving the bit sequence 11.
n=2 generates a polynomial whose largest root is the limit of Narayana's A058265.
n=3 ... is the tribonacci limit A058265.
n=4 ... is the 2nd Pisot number A086106.
n=5 is not valid (not self-describing).
n=6 ... is A109134.
n=7 ... is the tetranacci limit A086088.
n=8 ... is the silver (plastic) number A060006.
n=9 is not valid (not self-describing).
n=10 ... is a Pisot number A293506.
n=11 is not valid (not self-describing).
Sequences corresponding to larger values of n are not (currently) in the OEIS, except when n = 2^m - 1, which are limits to the generalized Fibonacci numbers.

Linas Vepstas, Table of n, a(n) for n = 0..10000
Linas Vepstas, On the Beta Transform, arXiv:1812.10593 [math.DS], 2018.

The binary representation for every integer 2n+1 encodes a polynomial p_n(x) but not all such polynomials have (positive, real) roots r_n that are self-describing. An integer n is valid if it is self-describing; the validity filter is theta_n(r_n) = 1 where theta_n(x) is recursively defined as theta_n(x) = theta_{n/2}(x) * (x < r_{n/2}) if n is even, and theta_n(x) = theta_{(n-1)/2}(x) if n is odd. The sequence starts with theta_0(x) = 1.

cp's OEIS Frontend

A060006 Decimal expansion of real root of x^3 - x - 1 (the plastic constant).

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Magma

Maple

Mathematica

PARI

PARI

PARI

PARI

Sage

Formula

Extensions

A005314 For n = 0, 1, 2, a(n) = n; thereafter, a(n) = 2*a(n-1) - a(n-2) + a(n-3).

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Haskell

Magma

Magma

Maple

Mathematica

PARI

PARI

SageMath

Formula

Extensions

A001685 a(0) = 1, a(1) = 2, a(2) = 3; for n >= 3, a(n) = a(n-2) + a(n-1)*Product_{i=1..n-3} a(i).

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Mathematica

PARI

Formula

Extensions

A136444 a(n) = Sum_{k=0..n} k*binomial(n-k, 2*k).

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Magma

Maple

Mathematica

Formula

A181532 a(0) = 0, a(1) = 1, a(2) = 1, a(3) = 2; a(n) = a(n-1) + a(n-2) + a(n-4).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula

Extensions

A109377 Expansion of ( 2+x+2*x^2 ) / ( 1-2*x+x^2-x^3 ).

A136444 a(n) = Sum_{k=0..n} kbinomial(n-k, 2k).

A109377 Expansion of ( 2+x+2x^2 ) / ( 1-2x+x^2-x^3 ).