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.

A179554 a(n) = ( ( a(n-1) * a(n-5) )^2 + ( a(n-2) * a(n-3)^2 * a(n-4) )^2 ) / a(n-6), a(1) = ... = a(6) = 1.

Original entry on oeis.org

1, 1, 1, 1, 1, 1, 2, 5, 29, 1241, 3642581, 80305336110269, 93845241317908146817718208193, 1831028415236189172750287983272896126569309241020364043033034
Offset: 1

Views

Author

Michael Somos, Jan 08 2011

Keywords

Comments

Similar to Somos-6 sequence but the recurrence is not bilinear.
log( log( a(n))) ~ n * log(c) where c = 2.0810189966245... is largest root of 0 = x^4 - x^3 - 2*x^2 - x + 1 according to Hone.

Programs

  • Magma
    I:=[1,1,1,1,1,1]; [n le 6 select I[n] else ((Self(n-1)*Self(n-5) )^2 + (Self(n-2)*Self(n-3)^2*Self(n-4))^2 )/Self(n-6): n in [1..20]]; // G. C. Greubel, Aug 14 2018
  • Mathematica
    a[1] = a[2] = a[3] = a[4] = a[5] = a[6] = 1; a[n_ /; n < 1] := a[7 - n];
    a[n_ /; n > 6] := a[n] = ((a[n - 1] a[n - 5])^2 + (a[n - 2] a[n - 3]^2 a[n - 4])^2)/ a[n - 6];

Formula

a(n) = a(7 - n).