login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A064693 Number of connected components remaining when decimal expansion of the number n is cut from a piece of paper. 1
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: A082069 A136755 A156775 * A325614 A319608 A230850

Adjacent sequences:  A064690 A064691 A064692 * A064694 A064695 A064696

KEYWORD

base,easy,nonn

AUTHOR

Matthew Conroy, Oct 11 2001

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 28 04:49 EDT 2020. Contains 334671 sequences. (Running on oeis4.)