|
|
A062893
|
|
Number of squares that can be obtained by using some or all of the digits of n.
|
|
0
|
|
|
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;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,11
|
|
LINKS
|
|
|
EXAMPLE
|
a(169) = 6 the squares obtained by using the digits are 1,9,16, 169, 196, 961.
|
|
MATHEMATICA
|
Table[Length[Select[Union[Drop[FromDigits/@Flatten[Permutations/@ Subsets[IntegerDigits[n]], 1], 1]], IntegerQ[Sqrt[#]] &]], {n, 0, 104}] (* Jayanta Basu, May 17 2013 *)
|
|
CROSSREFS
|
|
|
KEYWORD
|
base,nonn,easy
|
|
AUTHOR
|
|
|
EXTENSIONS
|
Corrected and extended by Larry Reeves (larryr(AT)acm.org) and Dean Hickerson, Jul 02 2001
|
|
STATUS
|
approved
|
|
|
|