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.

A027388 Write digits for n, count endpoints (version 3).

Original entry on oeis.org

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

Views

Author

Keywords

Comments

Number of endpoints: 0,8 - zero, 6,9 - one, 1,2,3,4,5 - two, 7 - four. - Michael B. Porter, Oct 28 2017

Examples

			The digit 1 has two endpoints, and the digit 8 has no endpoints, so a(18) = 2. - _Michael B. Porter_, Oct 28 2017
		

Crossrefs

Programs

Formula

a(10*n + d) = a(n) + e where e is the number of endpoints of single digit d. - David A. Corneth, Oct 28 2017

Extensions

a(6) corrected by Michael B. Porter, Oct 28 2017 (per Andrew Howroyd)
a(27) to a(80) by Michael B. Porter, Oct 28 2017