A064693 - OEIS

A064693

Number of connected components remaining when decimal expansion of the number n is cut from a piece of paper.

2, 1, 1, 1, 2, 1, 2, 1, 3, 2, 2, 1, 1, 1, 2, 1, 2, 1, 3, 2, 2, 1, 1, 1, 2, 1, 2, 1, 3, 2, 2, 1, 1, 1, 2, 1, 2, 1, 3, 2, 3, 2, 2, 2, 3, 2, 3, 2, 4, 3, 2, 1, 1, 1, 2, 1, 2, 1, 3, 2, 3, 2, 2, 2, 3, 2, 3, 2, 4, 3, 2, 1, 1, 1, 2, 1, 2, 1, 3, 2, 4, 3, 3, 3, 4, 3, 4, 3, 5, 4, 3, 2, 2, 2, 3, 2, 3, 2, 4, 3, 3, 2, 2, 2, 3

(list; graph; refs; listen; history; text; internal format)

OFFSET

0,1

LINKS

Table of n, a(n) for n=0..104.

EXAMPLE

We assume 1,2,3,5 have no hole; 0,4,6,9 have 1 hole; 8 has two holes. So cutting 8 from a piece of paper creates three connected components: one for each hole and one for the remainder of the paper. Hence a(8)=3.

CROSSREFS

Cf. A064531. Equals A064692 + 1.

Sequence in context: A136755 A156775 A377282 * A325614 A361746 A369917

Adjacent sequences: A064690 A064691 A064692 * A064694 A064695 A064696

KEYWORD

base,easy,nonn

AUTHOR

Matthew Conroy, Oct 11 2001

STATUS

approved