A086106 -id:A086106 - cp's OEIS frontend

A003269 a(n) = a(n-1) + a(n-4) with a(0) = 0, a(1) = a(2) = a(3) = 1.

0, 1, 1, 1, 1, 2, 3, 4, 5, 7, 10, 14, 19, 26, 36, 50, 69, 95, 131, 181, 250, 345, 476, 657, 907, 1252, 1728, 2385, 3292, 4544, 6272, 8657, 11949, 16493, 22765, 31422, 43371, 59864, 82629, 114051, 157422, 217286, 299915, 413966, 571388, 788674, 1088589, 1502555, 2073943

Offset: 0

N. J. A. Sloane

This comment covers a family of sequences which satisfy a recurrence of the form a(n) = a(n-1) + a(n-m), with a(n) = 1 for n = 0..m-1. The generating function is 1/(1-x-x^m). Also a(n) = Sum_{i=0..n/m} binomial(n-(m-1)*i, i). This family of binomial summations or recurrences gives the number of ways to cover (without overlapping) a linear lattice of n sites with molecules that are m sites wide. Special case: m=1: A000079; m=4: A003269; m=5: A003520; m=6: A005708; m=7: A005709; m=8: A005710.
For this family of sequences, a(n+1) is the number of compositions of n+1 into parts 1 and m. For n>=m, a(n-m+1)is the number of compositions of n in which each part is greater than m or equivalently, in which parts 1 through m are excluded. - Gregory L. Simay, Jul 14 2016
For this family of sequences, let a(m,n) = a(n-1) + a(n-m). Then the number of compositions of n having m as a least summand is a(m, n-m) - a(m+1, n-m-1). - Gregory L. Simay, Jul 14 2016
For n>=3, a(n-3) = number of compositions of n in which each part is >=4. - Milan Janjic, Jun 28 2010
For n>=1, number of compositions of n into parts == 1 (mod 4). Example: a(8)=5 because there are 5 compositions of 8 into parts 1 or 5: (1,1,1,1,1,1,1,1), (1,1,1,5), (1,1,5,1), (1,5,1,1), (5,1,1,1). - Adi Dani, Jun 16 2011
a(n+1) is the number of compositions of n into parts 1 and 4. - Joerg Arndt, Jun 25 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>=4, 2*a(n-3) equals the number of 2-colored compositions of n with all parts >= 4, such that no adjacent parts have the same color. - Milan Janjic, Nov 27 2011
Number of permutations satisfying -k<=p(i)-i<=r and p(i)-i not in I, i=1..n, with k=1, r=3, I={1,2}. - Vladimir Baltic, Mar 07 2012
a(n+4) equals the number of binary words of length n having at least 3 zeros between every two successive ones. - Milan Janjic, Feb 07 2015
From Clark Kimberling, Jun 13 2016: (Start)
Let T* be the infinite tree with root 0 generated by these rules: if p is in T*, then p+1 is in T* and x*p is in T*.
Let g(n) be the set of nodes in the n-th generation, so that g(0) = {0}, g(1) = {1}, g(2) = {2,x}, g(3) = {3, 2*x, x+1, x^2}, etc.
Let T(r) be the tree obtained by substituting r for x.
If N is a positive integer such that r = N^(1/4) is not an integer, then the number of (not necessarily distinct) integers in g(n) is A003269(n), for n > = 1. See A274142. (End)

			G.f.: x + x^2 + x^3 + x^4 + 2*x^5 + 3*x^6 + 4*x^7 + 5*x^8 + 7*x^9 + 10*x^10 + ...
The number of compositions of 12 having 4 as a least summand is a(4, 12 -4 + 1) - a(5, 12 - 5 + 1) = A003269(9) - A003520(8) = 7-4 = 3. The compositions are (84), (48) and (444). - _Gregory L. Simay_, Jul 14 2016

A. Brousseau, Fibonacci and Related Number Theoretic Tables. Fibonacci Association, San Jose, CA, 1972, p. 120.
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..501
Jarib R. Acosta, Yadira Caicedo, Juan P. Poveda, José L. Ramírez, and Mark Shattuck, Some New Restricted n-Color Composition Functions, J. Int. Seq., Vol. 22 (2019), Article 19.6.4.
Mudit Aggarwal and Samrith Ram, Generating Functions for Straight Polyomino Tilings of Narrow Rectangles, J. Int. Seq., Vol. 26 (2023), Article 23.1.4.
Michael A. Allen, On a Two-Parameter Family of Generalizations of Pascal's Triangle, arXiv:2209.01377 [math.CO], 2022.
Michael A. Allen, Connections between Combinations Without Specified Separations and Strongly Restricted Permutations, Compositions, and Bit Strings, arXiv:2409.00624 [math.CO], 2024. See pp. 18, 22.
J.-P. Allouche and T. Johnson, Narayana's cows and delayed morphisms, in G. Assayag, M. Chemillier, and C. Eloy, Troisièmes Journées d'Informatique Musicale, JIM '96, Île de Tatihou, France, 1996, pp. 2-7. [The hal link does not always work. - _N. J. A. Sloane_, Feb 19 2025]
J.-P. Allouche and T. Johnson, Narayana's cows and delayed morphisms, in G. Assayag, M. Chemillier, and C. Eloy, Troisièmes Journées d'Informatique Musicale, JIM '96, Île de Tatihou, France, 1996, pp. 2-7. [Local copy with annotations and a correction from _N. J. A. Sloane_, Feb 19 2025]
Peter G. Anderson, More Properties of the Zeckendorf Array, Fib. Quart. 52-5 (2014), 15-21. With 2 more initial zeros.
Vladimir Baltic, On the number of certain types of strongly restricted permutations, Applicable Analysis and Discrete Mathematics Vol. 4, No 1 (2010), 119-135.
D. Birmajer, J. B. Gil, and M. D. Weiner, On the Enumeration of Restricted Words over a Finite Alphabet, J. Int. Seq. 19 (2016) # 16.1.3, Example 9.
Bruce M. Boman, Geometric Capitulum Patterns Based on Fibonacci p-Proportions, Fibonacci Quart. 58 (2020), no. 5, 91-102.
Russ Chamberlain, Sam Ginsburg and Chi Zhang, Generating Functions and Wilf-equivalence on Theta_k-embeddings, University of Wisconsin, April 2012.
P. Chinn and S. Heubach, (1, k)-compositions, Congr. Numer. 164 (2003), 183-194. [Local copy]
Hùng Việt Chu, Nurettin Irmak, Steven J. Miller, László Szalay, and Sindy Xin Zhang, Schreier Multisets and the s-step Fibonacci Sequences, arXiv:2304.05409 [math.CO], 2023. See also Integers (2024) Vol. 24A, Art. No. A7, p. 3.
Adi Dani, Compositions of natural numbers over arithmetic progressions
E. Di Cera and Y. Kong, Theory of multivalent binding in one and two-dimensional lattices, Biophysical Chemistry, Vol. 61 (1996), pp. 107-124.
Larry Ericksen and Peter G. Anderson, Patterns in differences between rows in k-Zeckendorf arrays, The Fibonacci Quarterly, Vol. 50, February 2012.
I. M. Gessel and Ji Li, Compositions and Fibonacci identities, J. Int. Seq. 16 (2013) 13.4.5.
R. K. Guy, Letter to N. J. A. Sloane with attachment, 1988
V. C. Harris and C. C. Styles, A generalization of Fibonacci numbers, Fib. Quart. 2 (1964) 277-289, sequence u(n,3,1).
J. Hermes, Anzahl der Zerlegungen einer ganzen rationalen Zahl in Summanden, Math. Ann., 45 (1894), 371-380.
Brian Hopkins and Hua Wang, Restricted Color n-color Compositions, arXiv:2003.05291 [math.CO], 2020.
Jia Huang, Compositions with restricted parts, arXiv:1812.11010 [math.CO], 2018.
INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 377
Milan Janjic, Binomial Coefficients and Enumeration of Restricted Words, Journal of Integer Sequences, 2016, Vol 19, #16.7.3.
Sergey Kirgizov, Q-bonacci words and numbers, arXiv:2201.00782 [math.CO], 2022.
S. Kitaev, Independent sets on path-schemes, JIS 9 (2006) # 06.2.2 G(x) for M={1,2,3} gives seq. shifted 4 places left
R. J. Mathar, Paving rectangular regions with rectangular tiles: Tatami and Non-Tatami Tilings, arXiv:1311.6135 [math.CO], 2013, Table 17.
R. J. Mathar, Tilings of rectangular regions by rectangular tiles: Counts derived from transfer matrices, arXiv:1406.7788 [math.CO] (2014), eq. (23).
Flaviano Morone, Ian Leifer, and Hernán A. Makse, Fibration symmetries uncover the building blocks of biological networks, Proceedings of the National Academy of Sciences (2020) Vol. 117, No. 15, 8306-8314.
Augustine O. Munagi, Euler-type identities for integer compositions via zig-zag graphs, Integers 12 (2012), Paper No. A60, 10 pp.
Augustine O. Munagi, Integer Compositions and Higher-Order Conjugation, J. Int. Seq., Vol. 21 (2018), Article 18.8.5.
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), #16.8.3.
Djamila Oudrar and Maurice Pouzet, Ordered structures with no finite monomorphic decomposition. Application to the profile of hereditary classes, arXiv:2312.05913 [math.CO], 2023. See p. 18.
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
E. Wilson, The Scales of Mt. Meru
Dominika Závacká, Cristina Dalfó, and Miquel Angel Fiol, Integer sequences from k-iterated line digraphs, CEUR: Proc. 24th Conf. Info. Tech. - Appl. and Theory (ITAT 2024) Vol 3792, 156-161. See p. 161, Table 2.
Index entries for two-way infinite sequences
Index entries for linear recurrences with constant coefficients, signature (1,0,0,1).

Cf. A000045, A000079, A000930, A003520, A005708, A005709, A005710, A005711, A017898.
Cf. A048718, A072827, A072850, A072851, A072852, A072853, A072854, A072855, A072856.
Cf. A079955 - A080014.
See A017898 for an essentially identical sequence.
Row sums of A180184.

a003269 n = a003269_list !! n
a003269_list = 0 : 1 : 1 : 1 : zipWith (+) a003269_list
                                          (drop 3 a003269_list)
-- Reinhard Zumkeller, Feb 27 2011

I:=[0,1,1,1]; [n le 4 select I[n] else Self(n-1) + Self(n-4) :n in [1..50]]; // Marius A. Burtea, Sep 13 2019

with(combstruct): SeqSetU := [S, {S=Sequence(U), U=Set(Z, card > 3)}, unlabeled]: seq(count(SeqSetU, size=j), j=4..51);
seq(add(binomial(n-3*k,k),k=0..floor(n/3)),n=0..47); # Zerinvary Lajos, Apr 03 2007
A003269:=z/(1-z-z**4); # Simon Plouffe in his 1992 dissertation
ZL:=[S, {a = Atom, b = Atom, S = Prod(X,Sequence(Prod(X,b))), X = Sequence(b,card >= 3)}, unlabelled]: seq(combstruct[count](ZL, size=n), n=3..50); # Zerinvary Lajos, Mar 26 2008
M:= Matrix(4, (i,j)-> if j=1 then [1,0,0,1][i] elif (i=j-1) then 1 else 0 fi); a:= n-> (M^(n))[1,2]; seq(a(n), n=0..48); # Alois P. Heinz, Jul 27 2008

a[0]= 0; a[1]= a[2]= a[3]= 1; a[n_]:= a[n]= a[n-1] + a[n-4]; Table[a[n], {n,0,50}]
CoefficientList[Series[x/(1-x-x^4), {x,0,50}], x] (* Zerinvary Lajos, Mar 29 2007 *)
Table[Sum[Binomial[n-3*i-1,i], {i,0,(n-1)/3}], {n,0,50}]
LinearRecurrence[{1,0,0,1}, {0,1,1,1}, 50] (* Robert G. Wilson v, Jul 12 2014 *)
nxt[{a_,b_,c_,d_}]:={b,c,d,a+d}; NestList[nxt,{0,1,1,1},50][[;;,1]] (* Harvey P. Dale, May 27 2024 *)

{a(n) = polcoeff( if( n<0, (1 + x^3) / (1 + x^3 - x^4), 1 / (1 - x - x^4)) + x * O(x^abs(n)), abs(n))} /* Michael Somos, Jul 12 2003 */

@CachedFunction
def a(n): return ((n+2)//3) if (n<4) else a(n-1) + a(n-4) # a = A003269
[a(n) for n in (0..50)] # G. C. Greubel, Jul 25 2022

G.f.: x/(1-x-x^4).
G.f.: -1 + 1/(1-Sum_{k>=0} x^(4*k+1)).
a(n) = a(n-3) + a(n-4) + a(n-5) + a(n-6) for n>4.
a(n) = floor(d*c^n + 1/2) where c is the positive real root of -x^4+x^3+1 and d is the positive real root of 283*x^4-18*x^2-8*x-1 (c=1.38027756909761411... and d=0.3966506381592033124...). - Benoit Cloitre, Nov 30 2002
Equivalently, a(n) = floor(c^(n+3)/(c^4+3) + 1/2) with c as defined above (see A086106). - Greg Dresden and Shuer Jiang, Aug 31 2019
a(n) = term (1,2) in the 4 X 4 matrix [1,1,0,0; 0,0,1,0; 0,0,0,1; 1,0,0,0]^n. - Alois P. Heinz, Jul 27 2008
From Paul Barry, Oct 20 2009: (Start)
a(n+1) = Sum_{k=0..n} C((n+3*k)/4,k)*((1+(-1)^(n-k))/2 + cos(Pi*n/2))/2;
a(n+1) = Sum_{k=0..n} C(k,floor((n-k)/3))(2*cos(2*Pi*(n-k)/3)+1)/3. (End)
a(n) = Sum_{j=0..(n-1)/3} binomial(n-1-3*j,j) (cf. A180184). - Vladimir Kruchinin, May 23 2011
A017817(n) = a(-4 - n) * (-1)^n. - Michael Somos, Jul 12 2003
G.f.: Q(0)*x/2, where Q(k) = 1 + 1/(1 - x*(2*k+1 + x^3)/( x*(2*k+2 + x^3) + 1/Q(k+1) )); (continued fraction). - Sergei N. Gladkovskii, Aug 29 2013
Appears a(n) = hypergeometric([1/4-n/4,1/2-n/4,3/4-n/4,1-n/4], [1/3-n/3,2/3-n/3,1-n/3], -4^4/3^3) for n>=10. - Peter Luschny, Sep 18 2014

Additional comments from Yong Kong (ykong(AT)curagen.com), Dec 16 2000

Initial 0 prepended by N. J. A. Sloane, Apr 09 2008

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

Original entry on oeis.org

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

A092526 Decimal expansion of (2/3)cos( (1/3)arccos(29/2) ) + 1/3, the real root of x^3 - x^2 - 1.

Original entry on oeis.org

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

Offset: 1

N. J. A. Sloane, Apr 07 2004

This is the limit x of the ratio N(n+1)/N(n) for n -> infinity of the Narayana sequence N(n) = A000930(n). The real root of x^3 - x^2 - 1. See the formula section. - Wolfdieter Lang, Apr 24 2015
This is the fourth smallest Pisot number. - Iain Fox, Oct 13 2017
Sometimes called the supergolden ratio or Narayana's cows constant, and denoted by the symbol psi. - Ed Pegg Jr, Feb 01 2019

			1.46557123187676802665673122521993910802557756847228570164318311124926...

S. R. Finch, Mathematical Constants, Cambridge, 2003, Section 1.2.3.
Paul J. Nahin, The Logician and the Engineer, How George Boole and Claude Shannon Created the Information Age, Princeton University Press, Princeton and Oxford, 2013, Chap. 7: Some Combinational Logic Examples, Section 7.1: Channel Capacity, Shannon's Theorem, and Error-Detection Theory, page 120.

Harry J. Smith, Table of n, a(n) for n = 1..20000
Simon Baker, Exceptional digit frequencies and expansions in non-integer bases, arXiv:1711.10397 [math.DS], 2017. See the beta(2) constant pp. 3-4.
H. R. P. Ferguson, On a Generalization of the Fibonacci Numbers Useful in Memory Allocation Schema or All About the Zeroes of Z^k - Z^{k - 1} - 1, k > 0, Fibonacci Quarterly, Volume 14, Number 3, October, 1976 (see Table 2, p. 236).
Ed Pegg Jr., Images based on the supergolden ratio
Michael Penn, What is the super-golden ratio??, YouTube video, 2022.
Mario Raso, Integer Sequences in Cryptography: A New Generalized Family and its Application, Ph. D. Thesis, Sapienza University of Rome (Italy 2025). See p. 59.
Eric Weisstein's World of Mathematics, Pisot Number.
Eric Weisstein's World of Mathematics, Supergolden Ratio.
Wikipedia, Pisot number
Wikipedia, Supergolden ratio
Index entries for algebraic numbers, degree 3

Cf. A088559, A075778, A076725, A000930, A263719.
Other Pisot numbers: A060006, A086106, A228777, A293506, A293508, A293509, A293557.
Cf. A381124 (numerators of convergents).
Cf. A381125 (denominators of convergents).

RealDigits[(2 Cos[ ArcCos[ 29/2]/3] + 1)/3, 10, 111][[1]] (* Robert G. Wilson v, Apr 12 2004 *)
RealDigits[ Solve[ x^3 - x^2 - 1 == 0, x][[1, 1, 2]], 10, 111][[1]] (* Robert G. Wilson v, Oct 10 2013 *)

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

The real root of x^3 - x^2 - 1. - Franklin T. Adams-Watters, Oct 12 2006
The only real irrational root of x^4-x^2-x-1 (-1 is also a root). [Nahim]
Equals (2/3)*cos( (1/3)*arccos(29/2) ) + 1/3.
Equals 1 + A088559.
Equals (1/6)*(116+12*sqrt(93))^(1/3) + 2/(3*(116+12*sqrt(93))^(1/3)) + 1/3. - Vaclav Kotesovec, Dec 18 2014
Equals 1/A263719. - Alois P. Heinz, Apr 15 2018
Equals (1 + 1/r + r)/3 where r = ((29 + sqrt(837))/2)^(1/3). - Peter Luschny, Apr 04 2020
Equals (1/3)*(1 + ((1/2)*(29 + (3*sqrt(93))))^(1/3) + ((1/2)*(29 - 3*sqrt(93)))^(1/3)). See A075778. - Wolfdieter Lang, Aug 17 2022

A293506 Decimal expansion of real root of x^5 - x^4 - x^2 - 1.

Original entry on oeis.org

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

Offset: 1

Iain Fox, Oct 10 2017

This root is also the ninth smallest of the Pisot numbers.

The ratio of successive terms of A122115 converges to this number.

			1.570147312196054362910665...

Iain Fox, Table of n, a(n) for n = 1..20000
Hans Walser, Funktionenfolge [in German]
Eric Weisstein's World of Mathematics, Pisot Number.
Wikipedia, Pisot-Vijayaraghavan number
Index entries for algebraic numbers, degree 5

Cf. A060006, A086106, A228777, A092526, A293508, A293509, A293557, A122115, A293560 (inverse).

First@ RealDigits[Root[#^5 - #^4 - #^2 - 1 &, 1], 10, 87] (* Michael De Vlieger, Oct 23 2017 *)

solve(x=1, 2, x^5 - x^4 - x^2 - 1) \\ Michel Marcus, Oct 11 2017

default(realprecision, 20080); x=solve(x=1, 2, x^5 - x^4 - x^2 - 1); for (n=1, 20000, d=floor(x); x=(x-d)*10; write("b293506.txt", n, " ", d));

More terms from Andrey Zabolotskiy, Oct 12 2017

A014097 a(n) = a(n-1)+a(n-4).

Original entry on oeis.org

1, 1, 1, 5, 6, 7, 8, 13, 19, 26, 34, 47, 66, 92, 126, 173, 239, 331, 457, 630, 869, 1200, 1657, 2287, 3156, 4356, 6013, 8300, 11456, 15812, 21825, 30125, 41581, 57393, 79218, 109343, 150924, 208317, 287535

Offset: 1

David Broadhurst

Number of ways to cover (without overlapping) a ring lattice (necklace) of n sites with molecules that are 4 sites wide.

This comment covers a family of sequences which satisfy a recurrence of the form a(n) = a(n-1) + a(n-m), with a(n) = 1 for n = 1...m-1, a(m) = m+1. The generating function is (x+m*x^m)/(1-x-x^m). Also a(n) = 1 + n*Sum_{i=1..n/m} binomial(n-1-(m-1)*i, i-1)/i. This gives the number of ways to cover (without overlapping) a ring lattice (or necklace) of n sites with molecules that are m sites wide. Special cases: m=2: A000204, m=3: A001609, m=4: A014097, m=5: A058368, m=6: A058367, m=7: A058366, m=8: A058365, m=9: A058364.

Indranil Ghosh, Table of n, a(n) for n = 1..7130
D. J. Broadhurst, Conjectured enumeration of irreducible multiple zeta values, from knots and Feynman diagrams, arXiv:hep-th/9612012, 1996.
E. Di Cera and Y. Kong, Theory of multivalent binding in one and two-dimensional lattices, Biophysical Chemistry, Vol. 61 (1996), pp. 107-124.
Index entries for linear recurrences with constant coefficients, signature (1,0,0,1).

Cf. A020999, A000204, A001609, A000079, A003269, A003520, A005708, A005709, A005710.

LinearRecurrence[{1,0,0,1},{1,1,1,5},40] (* Harvey P. Dale, Mar 06 2016 *)

a(n):=sum(binomial(n-3*j,n-4*j)*n/(n-3*j),j,0,(n-1)/3); /* Vladimir Kruchinin, Mar 25 2016 */

a(n)=([0,1,0,0; 0,0,1,0; 0,0,0,1; 1,0,0,1]^(n-1)*[1;1;1;5])[1,1] \\ Charles R Greathouse IV, Sep 09 2016

G.f.: -x*(1+4*x^3)/(-1+x+x^4). a(n)= 4*A003269(n)-3*A003269(n-1). - R. J. Mathar, Nov 16 2007
a(n) = Sum_{j=0..(n-1)/3}(binomial(n-3*j,n-4*j)*n/(n-3*j)). - Vladimir Kruchinin, Mar 25 2016
From Greg Dresden, Aug 23 2019: (Start)
a(n) = r1^n + r2^n + r3^n + r4^n, where {r1,r2,r3,r4} are the four roots of x^4-x^3-1=0, see A086106, A230151.
a(n) = round(r^n) for n>21 and r the positive real root of x^4-x^3-1.
(End)

Additional comments from Yong Kong (ykong(AT)curagen.com), Dec 16 2000

cp's OEIS Frontend

A167287 Signature sequence of Pisot number 1.3802775690976206... (A086106).

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

A003269 a(n) = a(n-1) + a(n-4) with a(0) = 0, a(1) = a(2) = a(3) = 1.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Haskell

Magma

Maple

Mathematica

PARI

SageMath

Formula

Extensions

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

A092526 Decimal expansion of (2/3)*cos( (1/3)*arccos(29/2) ) + 1/3, the real root of x^3 - x^2 - 1.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A293506 Decimal expansion of real root of x^5 - x^4 - x^2 - 1.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

PARI

Extensions

A014097 a(n) = a(n-1)+a(n-4).

Views

Author

Keywords

Comments

Links

Crossrefs

A092526 Decimal expansion of (2/3)cos( (1/3)arccos(29/2) ) + 1/3, the real root of x^3 - x^2 - 1.