login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A064531
Number of connected components remaining when decimal expansion of the number n is cut from a piece of paper.
4
2, 1, 1, 1, 1, 1, 2, 1, 3, 2, 2, 1, 1, 1, 1, 1, 2, 1, 3, 2, 2, 1, 1, 1, 1, 1, 2, 1, 3, 2, 2, 1, 1, 1, 1, 1, 2, 1, 3, 2, 2, 1, 1, 1, 1, 1, 2, 1, 3, 2, 2, 1, 1, 1, 1, 1, 2, 1, 3, 2, 3, 2, 2, 2, 2, 2, 3, 2, 4, 3, 2, 1, 1, 1, 1, 1, 2, 1, 3, 2, 4, 3, 3, 3, 3, 3, 4, 3, 5, 4, 3, 2, 2, 2, 2, 2, 3, 2, 4, 3, 3, 2, 2, 2, 2
OFFSET
0,1
COMMENTS
Assumes that 4 is represented without a hole.
MATHEMATICA
a[n_ /; 0 <= n <= 9] := a[n] = {2, 1, 1, 1, 1, 1, 2, 1, 3, 2}[[n + 1]]; a[n_] := Total[a /@ (id = IntegerDigits[n])] - Length[id] + 1 ; Table[a[n], {n, 0, 104}] (* Jean-François Alcover, Nov 22 2013 *)
CROSSREFS
Cf. A064529, A064530. Equals A064532 + 1.
Sequence in context: A025919 A095684 A205565 * A274468 A211993 A185646
KEYWORD
nonn,easy,base
AUTHOR
N. J. A. Sloane, Oct 07 2001
EXTENSIONS
More terms from Matthew Conroy, Oct 09 2001
STATUS
approved