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.

A154629 Period 9: repeat [9, 3, 1, 3, 3, 1, 3, 9, 1].

Original entry on oeis.org

9, 3, 1, 3, 3, 1, 3, 9, 1, 9, 3, 1, 3, 3, 1, 3, 9, 1, 9, 3, 1, 3, 3, 1, 3, 9, 1, 9, 3, 1, 3, 3, 1, 3, 9, 1, 9, 3, 1, 3, 3, 1, 3, 9, 1, 9, 3, 1, 3, 3, 1, 3, 9, 1, 9, 3, 1, 3, 3, 1, 3, 9, 1, 9, 3, 1, 3, 3, 1, 3, 9, 1, 9, 3, 1, 3, 3, 1, 3, 9, 1, 9, 3, 1, 3, 3
Offset: 0

Views

Author

Paul Curtz, Jan 13 2009

Keywords

Comments

Greatest common divisor of (n+1)^2-1 and (n+1)^2+8. - Bruno Berselli, Mar 08 2017

Crossrefs

Programs

  • Mathematica
    With[{n=5}, PadLeft[{}, 9n, {9,3,1,3,3,1,3,9,1}]] (* Harvey P. Dale, Oct 22 2011 *)
  • PARI
    Vec((9 + 3*x + x^2 + 3*x^3 + 3*x^4 + x^5 + 3*x^6 + 9*x^7 + x^8) / ((1 - x)*(1 + x + x^2)*(1 + x^3 + x^6)) + O(x^100)) \\ Colin Barker, Dec 21 2017

Formula

a(n) = A147674(n)/9.
a(n) = A005563(n) / A144454(n+1) for n>0.
From Colin Barker, Dec 21 2017: (Start)
G.f.: (9 + 3*x + x^2 + 3*x^3 + 3*x^4 + x^5 + 3*x^6 + 9*x^7 + x^8) / ((1 - x)*(1 + x + x^2)*(1 + x^3 + x^6)).
a(n) = a(n-9) for n>8.
(End)