Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #11 May 12 2024 10:09:06
%S 1,64,729,1000,2197,4096,9261,15625,19683,21952,46656,64000,91125,
%T 110592,117649,132651,157464,216000,226981,262144,328509,343000,
%U 373248,531441,592704,614125,681472,729000,884736,912673,1000000,1061208,1157625
%N Cubes which are anagrams of squares.
%C If k is present then so is 1000k.
%C Cube root of n's: 1, 4, 9, 10, 13, 16, 21, 25, 27, 28, 36, 40, 45, 48, 49, 51, 54, 60, 61, 64, ..., .
%C Leading zeros in squares are allowed, i.e. an anagram of 1000 is 0001. - _Chai Wah Wu_, Nov 04 2016
%H Robert G. Wilson v and Chai Wah Wu, <a href="/A161861/b161861.txt">Table of n, a(n) for n = 1..10000</a> a(n) for n = 1..872 from Robert G. Wilson v.
%e 2197 is a term because it is a cube (13^3) and 7921 (an anagram of 2197) is a square (89 * 89).
%t fQ[n_] := Union[ IntegerQ@ Sqrt@ FromDigits@ # & /@ Permutations@ IntegerDigits@ n][[-1]] == True; lst = {}; Do[ If[ fQ[n^3], AppendTo[lst, n^3]; Print[n^3]], {n, 1650}] (* Or for larger n's *)
%t (* first do *) Needs[ "Combinatorica`" ] (* then *) fQ[ n_ ] := Block[ {id = IntegerDigits@n, k = 1, mx = Floor[ Log[ 10, n ] +1 ]! +1}, While[ k < mx && !IntegerQ@ Sqrt@ FromDigits@ UnrankPermutation[ k,id ], k++ ]; If[ k != mx, True, False ] ]
%Y Includes A001014.
%K nonn,base
%O 1,2
%A _Claudio Meller_, Jun 20 2009
%E Edited, corrected, extended by _Robert G. Wilson v_, Jun 30 2009