id:A064531 - OEIS Search Results

Search: id:A064531

Displaying 1-1 of 1 results found.

page 1

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

+0
5

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 (list; graph; listen)

	OFFSET	`0,1`
	COMMENT	`Assumes that 4 is represented without a hole.`
	LINKS	`Matthew M. Conroy, Home page (listed instead of email address)`
	CROSSREFS	`Cf. A064529, A064530. Equals A064532 + 1.` `Adjacent sequences: A064528 A064529 A064530 this_sequence A064532 A064533 A064534` `Sequence in context: A120698 A025919 A095684 this_sequence A037829 A117546 A096811`
	KEYWORD	`nonn,easy,base`
	AUTHOR	`njas, Oct 07 2001`
	EXTENSIONS	`More terms from Matthew M. Conroy, Oct 09 2001`

page 1

Search completed in 0.002 seconds

Last modified October 13 20:18 EDT 2008. Contains 145016 sequences.

AT&T Labs Research