id:A062892 - OEIS Search Results

Search: id:A062892

Displaying 1-1 of 1 results found.

page 1

Number of squares that can be obtained by permuting the digits of n.

+0
6

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

	OFFSET	`0,101`
	FORMULA	`a(A096600(n))=0; a(A007937(n))>0; a(A096599(n))=1; a(A096598(n))>1. - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Jun 29 2004`
	EXAMPLE	`a(169) = 3 the squares obtained by permuting the digits are 169, 196, 961.`
	CROSSREFS	`Sequence in context: A037281 A143241 A118626 this_sequence A118553 A102448 A102683` `Adjacent sequences: A062889 A062890 A062891 this_sequence A062893 A062894 A062895`
	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), Jul 02 2001`

page 1

Search completed in 0.005 seconds

Last modified November 23 17:09 EST 2009. Contains 167438 sequences.

AT&T Labs Research