id:A062893 - OEIS Search Results

Search: id:A062893

Displaying 1-1 of 1 results found.

page 1

Number of squares that can be obtained by using some or all of the digits of n.

+0
1

1, 1, 0, 0, 1, 0, 0, 0, 0, 1, 2, 1, 1, 1, 2, 1, 2, 1, 2, 2, 1, 1, 0, 0, 1, 1, 0, 0, 0, 1, 1, 1, 0, 0, 1, 0, 1, 0, 0, 1, 2, 2, 1, 1, 1, 1, 2, 1, 1, 3, 1, 1, 1, 0, 1, 0, 0, 0, 0, 1, 1, 2, 0, 1, 2, 0, 0, 0, 0, 1, 1, 1, 0, 0, 1, 0, 0, 0, 0, 1, 1, 2, 0, 0, 1, 0, 0, 0, 0, 1, 2, 2, 1, 1, 3, 1, 1, 1, 1, 1, 3, 2, 2, 2, 3 (list; graph; listen)

	OFFSET	`0,11`
	EXAMPLE	`a(169) = 6 the squares obtained by using the digits are 1,9,16, 169, 196, 961.`
	CROSSREFS	`Sequence in context: A124766 A103765 A125029 this_sequence A158210 A087802 A079553` `Adjacent sequences: A062890 A062891 A062892 this_sequence A062894 A062895 A062896`
	KEYWORD	`base,nonn,easy`
	AUTHOR	`Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Jun 29 2001`
	EXTENSIONS	`Corrected and extended by Larry Reeves (larryr(AT)acm.org) and Dean Hickerson (dean.hickerson(AT)yahoo.com), Jul 02 2001`

page 1

Search completed in 0.002 seconds

Last modified November 27 22:38 EST 2009. Contains 167602 sequences.

AT&T Labs Research