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.

A142069 Period 9: repeat 3, 7, 2, 6, 1, 5, 0, 4, 8.

Original entry on oeis.org

3, 7, 2, 6, 1, 5, 0, 4, 8, 3, 7, 2, 6, 1, 5, 0, 4, 8, 3, 7, 2, 6, 1, 5, 0, 4, 8, 3, 7, 2, 6, 1, 5, 0, 4, 8, 3, 7, 2, 6, 1, 5, 0, 4, 8, 3, 7, 2, 6, 1, 5, 0, 4, 8, 3, 7, 2, 6, 1, 5, 0, 4, 8, 3, 7, 2, 6, 1, 5, 0, 4, 8, 3, 7, 2, 6, 1, 5, 0, 4, 8, 3, 7, 2, 6, 1, 5, 0, 4, 8, 3, 7, 2, 6, 1, 5, 0, 4, 8, 3, 7, 2, 6, 1, 5
Offset: 1

Views

Author

Paul Curtz, Sep 14 2008

Keywords

Comments

The periodic part contains all digits from 0 to 8 and is a permutation of A141726.
Also the continued fractions of (13475 + sqrt(212576401))/8952 and the decimal expansion of 414016720/111111111.

Crossrefs

Formula

a(n) = A141694(n) mod 9.
a(n) = a(n-9).
G.f.: -x*(3 + 7*x + 2*x^2 + 6*x^3 + x^4 + 5*x^5 + 4*x^7 + 8*x^8)/((x-1)*(1 + x + x^2)*(x^6 + x^3 + 1)).
a(3n+1) + a(3n+2) + a(3n+3) = A010851(n).

Extensions

Edited for readability by R. J. Mathar, Sep 11 2009

A178027 Multiples of 5291.

Original entry on oeis.org

0, 5291, 10582, 15873, 21164, 26455, 31746, 37037, 42328, 47619, 52910, 58201, 63492, 68783, 74074, 79365, 84656, 89947, 95238, 100529, 105820, 111111, 116402, 121693, 126984, 132275, 137566, 142857, 148148, 153439, 158730, 164021, 169312, 174603, 179894, 185185
Offset: 0

Views

Author

Paul Curtz, May 17 2010

Keywords

Crossrefs

Programs

Formula

a(n) = n*5291. - R. J. Mathar, May 24 2010
a(n) mod 9 = A141726(n) = 8 - A010878(n-1). - Jean-François Alcover, Mar 03 2016, after Paul Curtz.
From Elmo R. Oliveira, Jun 26 2025: (Start)
G.f.: 5291*x/(1-x)^2.
E.g.f.: 5291*x*exp(x).
a(n) = 2*a(n-1) - a(n-2). (End)

Extensions

More terms from Elmo R. Oliveira, Jun 26 2025
Showing 1-2 of 2 results.