This site is supported by donations to The OEIS Foundation. Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing. Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A135780 Squares such that another square can be obtained by a cyclic permutation of the digits, excluding leading zeros. 2
 144, 196, 256, 441, 625, 961, 11664, 14884, 16384, 16641, 25600, 36864, 38416, 46656, 48841, 60025, 61009, 66564, 86436, 96100, 166464, 214369, 216225, 236196, 272484, 364816, 436921, 481636, 622521, 646416, 842724, 870489, 898704, 962361 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS This is a subsequence of A034289. It seems that there are never more than two squares having the same digits up to a cyclic permutation (checked up to (10^8)^2). LINKS M. F. Hasler, Table of n, a(n) for n = 1..816 EXAMPLE a(1) = 144 = 12^2 is the least square such that a cyclic permutation of its decimal digits is again a square, namely 441 = 21. a(2) = 196 = 14^2 is the second least square having this property, with 961 = 19^2. A034289(2)=169 does not figure here, since the permutations of its digits yielding squares are 196 and 961, which are not cyclic permutations of 169. The number 25600 is here since 60025 is also a square. The fact that 00256 also is a square is irrelevant: permutations with leading zeros are not considered. MATHEMATICA scpQ[n_]:=Module[{idn=IntegerDigits[n], r}, r=DeleteCases[Rest[ NestList[ RotateRight[ #]&, IntegerDigits[ n], IntegerLength[n]-1]], _?(First[#] == 0&)]; AnyTrue[FromDigits/@r, IntegerQ[Sqrt[#]]&]]; Select[Range[ 1000]^2, scpQ] (* This program uses the AnyTrue function from Mathematica version 10 *) (* Harvey P. Dale, Aug 21 2014 *) PROG (PARI) for(n=1, 10^8, (t=n^2)/* %10 || next <= this would exclude terms with trailing '0's */; found=0; for(j=1, k=#Str(t)-1, t=divrem(t, 10); t || (t=t) && next /* <= this excludes leading '0's */; issquare(t=t+10^k*t) || next; /* t%10 || next; <= would exclude permutations with trailing '0's */ print1( if(found, "<<<"/* mark multiple permutations: this never happens */, found=1; n^2)", "))) CROSSREFS Cf. A034289 (allowing arbitrary permutations), A135770. Sequence in context: A257412 A165076 A165078 * A069701 A124144 A276564 Adjacent sequences:  A135777 A135778 A135779 * A135781 A135782 A135783 KEYWORD base,easy,nonn,nice AUTHOR David W. Wilson and M. F. Hasler, Jan 09 2008 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 15 20:00 EST 2019. Contains 330000 sequences. (Running on oeis4.)