A072876 -id:A072876 - cp's OEIS frontend

A111459 Generalized Somos-4 sequence with a(n-2)^2 replaced by a(n-2)^5.

1, 1, 1, 1, 2, 3, 35, 313, 26261407, 1001689887346, 356879751557595054813966522072161803, 3221974575788016845202611315068840860244866942009716269469

Offset: 0

Andrew Hone, Nov 15 2005

nonn

Seiichi Manyama, Table of n, a(n) for n = 0..14
S. Fomin and A. Zelevinsky, The Laurent Phenomenon, Advances in Applied Mathematics 28 (2002), 119-144.
D. Gale, Tracking the Automatic Ant, Springer (1998), pp. 1-5.
D. Gale, The strange and surprising saga of the Somos sequences, Math. Intelligencer 13(1) (1991), pp. 40-42.
D. Gale, Somos sequence update, Mathematical Intelligencer 13 (4) (1991), 49-50.

Cf. A006720, A072876, A072877.

L[0]:=0; L[1]:=0; L[2]:=0; L[3]:=0; for n from 0 to 4000 do L[n+4]:=evalf(ln(1+exp(L[n+3]+L[n+1]-5*L[n+2]))+5*L[n+2]-L[n]): od: for n from 3990 to 4000 do print(evalf(ln(L[n+4])/(n+4))): od: #Note: this calculates L[n]=ln(a[n]) and illustrates slow convergence of ln(ln(a[n]))/n to 0.783...

a(n) = (a(n-1)*a(n-3) + a(n-2)^5)/a(n-4) for n >= 4 with a(0) = a(1) = a(2) = a(3) = 1. As n tends to infinity, log(log(a(n)))/n tends to (1/2)*log((5 + sqrt(21))/2) or about 0.783.

A217787 a(n) = (a(n-1)*a(n-3) + 1) / a(n-4) with a(0) = a(1) = a(2) = a(3) = 1.

Original entry on oeis.org

1, 1, 1, 1, 2, 3, 4, 9, 14, 19, 43, 67, 91, 206, 321, 436, 987, 1538, 2089, 4729, 7369, 10009, 22658, 35307, 47956, 108561, 169166, 229771, 520147, 810523, 1100899, 2492174, 3883449, 5274724, 11940723, 18606722, 25272721, 57211441, 89150161, 121088881

Offset: 0

Michael Somos, Mar 25 2013

This sequence is similar to A005246 whose recursion is a(n) = (a(n-1)*a(n-2) + 1) / a(n-3). - Michael Somos, Feb 10 2017

			G.f. = 1 + x + x^2 + x^3 + 2*x^4 + 3*x^5 + 4*x^6 + 9*x^7 + 14*x^8 + 19*x^9 + ...

Seiichi Manyama, Table of n, a(n) for n = 0..4411
Matthew Christopher Russell, Using experimental mathematics to conjecture and prove theorems in the theory of partitions and commutative and non-commutative recurrences, PhD Dissertation, Mathematics Department, Rutgers University, May 2016. See (better) also. See Example 6.2.18.
Index entries for linear recurrences with constant coefficients, signature (0,0,5,0,0,-1).

Cf. A003501.

Cf. A005246, A048736, A006720, A072876, A072877, A111459.

[n le 3 select 1 else (Self(n)*Self(n-2)+1)/Self(n-3): n in [0..40]]; // Bruno Berselli, Mar 25 2013

a[ n_] := With[{m = If [n < 0, 3 - n, n]}, SeriesCoefficient[ (1 + x + x^2 - 4 x^3 - 3 x^4 - 2 x^5) / (1 - 5 x^3 + x^6), {x, 0, m}]]; (* Michael Somos, Jan 18 2015 *)
LinearRecurrence[{0,0,5,0,0,-1},{1,1,1,1,2,3},40] (* Harvey P. Dale, Nov 20 2016 *)

{a(n) = if( n<0, n = 3-n); polcoeff( (1 + x + x^2 - 4*x^3 - 3*x^4 - 2*x^5) / (1 - 5*x^3 + x^6) + x * O(x^n), n)};

G.f.: (1 + x + x^2 - 4*x^3 - 3*x^4 - 2*x^5) / (1 - 5*x^3 + x^6).
a(n) = a(3-n) for all n in Z.
a(n+3) + a(n-3) = 5*a(n) for all n in Z.
a(n+1) + a(n-1) = a(n) * (2 + [n mod 3 == 0]) for all n in Z.
a(n+3k)+a(n-3k) = A003501(k)*a(n) for n>=3k. - Bruno Berselli, Mar 25 2013

cp's OEIS Frontend

A111459 Generalized Somos-4 sequence with a(n-2)^2 replaced by a(n-2)^5.

Views

Author

Keywords

Links

Crossrefs

Programs

Maple

Formula

A217787 a(n) = (a(n-1)*a(n-3) + 1) / a(n-4) with a(0) = a(1) = a(2) = a(3) = 1.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Magma

Mathematica

PARI

Formula