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.

A077505 a(n) = A077504(n) - n*10^d where d = n - number of digits in n.

Original entry on oeis.org

3, 7, 1, 21, 11, 3, 23, 11, 7, 21, 7, 21, 3, 7, 7, 9, 29, 9, 11, 59, 97, 3, 11, 163, 147, 91, 87, 23, 7, 291, 167, 337, 73, 93, 133, 3, 177, 257, 7, 149, 103, 3, 27, 13, 39, 137, 19, 31, 351, 209, 151, 489, 101, 153, 281, 139, 81, 47, 367, 189, 47, 29, 199, 3, 1, 63, 29, 83
Offset: 2

Views

Author

Amarnath Murthy, Nov 08 2002

Keywords

Comments

A guess: number of digits in a(n) < log(n) for large n.

Examples

			a(5) = 50021 - 50000 = 21.
		

Crossrefs

Extensions

More terms from Sascha Kurz, Jan 04 2003