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.

Showing 1-2 of 2 results.

A156551 Period 10: repeat [8,6,0,4,2,2,4,0,6,8].

Original entry on oeis.org

8, 6, 0, 4, 2, 2, 4, 0, 6, 8, 8, 6, 0, 4, 2, 2, 4, 0, 6, 8, 8, 6, 0, 4, 2, 2, 4, 0, 6, 8, 8, 6, 0, 4, 2, 2, 4, 0, 6, 8, 8, 6, 0, 4, 2, 2, 4, 0, 6, 8, 8, 6, 0, 4, 2, 2, 4, 0, 6, 8, 8, 6, 0, 4, 2, 2, 4, 0, 6, 8, 8, 6, 0, 4, 2, 2, 4, 0, 6, 8, 8, 6, 0, 4, 2, 2, 4, 0, 6, 8
Offset: 0

Views

Author

Paul Curtz, Feb 09 2009

Keywords

Comments

See A131715.

Crossrefs

Formula

a(n) = A155110(n) mod 10.
G.f.: 2*(4*x^8-x^7+x^6+x^5+x^3+x^2-x+4)/((1-x)*(x^4-x^3+x^2-x+1)*(x^4+x^3+x^2+x+1)). - R. J. Mathar, Feb 23 2009
a(n) = (15*(4-m^4+8*m^3-19*m^2+12*m)-2*(m^3-6*m^2+17*m-18)*(-1)^floor(n/5))/12 where m = n-5*floor(n/5). - Luce ETIENNE, Oct 13 2017

Extensions

Edited by R. J. Mathar, Feb 23 2009
More terms from Jinyuan Wang, Feb 26 2020

A156331 a(n)=8*A154811(n).

Original entry on oeis.org

8, 16, 40, 32, 56, 64, 64, 56, 32, 40, 16, 8, 8, 16, 40, 32, 56, 64, 64, 56, 32, 40, 16, 8, 8, 16, 40, 32, 56, 64, 64, 56, 32, 40, 16, 8, 8, 16, 40, 32, 56, 64, 64, 56, 32, 40, 16, 8, 8, 16, 40, 32, 56, 64, 64, 56, 32, 40, 16, 8, 8, 16, 40, 32, 56, 64, 64, 56, 32, 40, 16, 8, 8, 16, 40
Offset: 0

Views

Author

Paul Curtz, Feb 08 2009

Keywords

Programs

  • Mathematica
    8*Mod[Fibonacci[Range[1,151,2]],9] (* or *) PadRight[{},80,{8,16,40,32,56,64,64,56,32,40,16,8}] (* Harvey P. Dale, Jul 10 2018 *)

Formula

Period length 12: a(n)=a(n-12).
a(n) = A154811(n+6) = A155110(n) (mod 9).

Extensions

Edited and extended by R. J. Mathar, Apr 10 2009
Showing 1-2 of 2 results.