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.

A081261 Start with a(1)=4; apply 4 -> 665, 5 -> 56665, 6 -> 566665; iterate.

Original entry on oeis.org

4, 6, 6, 5, 5, 6, 6, 6, 6, 5, 5, 6, 6, 6, 6, 5, 5, 6, 6, 6, 5, 5, 6, 6, 6, 5, 5, 6, 6, 6, 6, 5, 5, 6, 6, 6, 6, 5, 5, 6, 6, 6, 6, 5, 5, 6, 6, 6, 6, 5, 5, 6, 6, 6, 5, 5, 6, 6, 6, 5, 5, 6, 6, 6, 6, 5, 5, 6, 6, 6, 6, 5, 5, 6, 6, 6, 6, 5, 5, 6, 6, 6, 6, 5, 5, 6, 6, 6, 5, 5, 6, 6, 6, 5, 5, 6, 6, 6, 6, 5, 5, 6, 6, 6, 6
Offset: 1

Views

Author

Matthew Vandermast, Mar 14 2003

Keywords

Comments

a(n)= A081260(n) - A081260(n-1) (taking A081260(0) as equal to 0). Sum of first n terms = A081260(n).

Examples

			4 -> 665 -> 56666556666556665 -> ...
		

Crossrefs