|
| |
|
|
A062892
|
|
Number of squares that can be obtained by permuting the digits of n.
|
|
5
|
|
|
|
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;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
0,101
|
|
|
LINKS
|
Table of n, a(n) for n=0..104.
|
|
|
FORMULA
|
a(A096600(n))=0; a(A007937(n))>0; a(A096599(n))=1; a(A096598(n))>1. - Reinhard Zumkeller, Jun 29 2004
|
|
|
EXAMPLE
|
a(169) = 3 the squares obtained by permuting the digits are 169, 196, 961.
|
|
|
MATHEMATICA
|
Table[t1=Table[FromDigits[k], {k, Permutations[IntegerDigits[n]]}]; p=Length[Select[t1, IntegerQ[Sqrt[#]]&]], {n, 0, 104}] (* Jayanta Basu, May 17 2013 *)
|
|
|
CROSSREFS
|
Sequence in context: A143241 A118626 * A118553 A102448 A102683 A122840
Adjacent sequences: A062889 A062890 A062891 * 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
|
|
|
STATUS
|
approved
|
| |
|
|
