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.

A137936 a(n) = 5*mod(n,5) + floor(n/5).

Original entry on oeis.org

0, 5, 10, 15, 20, 1, 6, 11, 16, 21, 2, 7, 12, 17, 22, 3, 8, 13, 18, 23, 4, 9, 14, 19, 24, 5, 10, 15, 20, 25, 6, 11, 16, 21, 26, 7, 12, 17, 22, 27, 8, 13, 18, 23, 28, 9, 14, 19, 24, 29, 10, 15, 20, 25, 30, 11, 16, 21, 26, 31, 12, 17, 22, 27, 32, 13, 18, 23, 28, 33, 14, 19, 24, 29, 34
Offset: 0

Views

Author

William A. Tedeschi, Mar 06 2008

Keywords

Examples

			a(0) = 5*mod(0,5) + floor(0/5) = 0
a(3) = 5*mod(3,5) + floor(3/5) = 15
		

Crossrefs

Programs

  • Python
    a = lambda n: 5*(n%5) + floor(n/5)

Formula

a(n) = 5*mod(n,5) + floor(n/5) = 5*A010874(n) + A002266(n)
O.g.f.: -x(-5x^3+19x^4-5x^2-5x-5)/[(-1+x)^2*(x^3+x^4+x^2+x+1)] . - R. J. Mathar, Mar 07 2008