|
|
A133197
|
|
Triangular numbers such that moving the first digit to the end produces a square number.
|
|
2
|
|
|
1, 10, 136, 406, 111628, 400960, 624403, 40423536, 1119043156276, 4291092052416, 600441627703203, 93344240136333376, 4950849307261614030, 9159508712581260256, 91853946457361410960, 94418158421136440556, 108128255436355107240, 111546878242671354528
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
The square roots are: 1, 1, 19, 8, 341, 98, 494, 2058, 1091069, 1706142, 2101494 - Robert G. Wilson v, Oct 14 2007
|
|
LINKS
|
|
|
EXAMPLE
|
136 is a triangular number, 361 is a square number - hence 136 belongs to this sequence.
|
|
MATHEMATICA
|
Select[Table[n(n + 1)/2, {n, 1000000}], IntegerQ[Sqrt[ FromDigits[ Append[Drop[IntegerDigits[ # ], 1], First[IntegerDigits[ # ]]]]]] &]
lst = {}; Do[ t = n (n + 1)/2; id = IntegerDigits@ t; If[MemberQ[{1, 4, 5, 6, 9}, id[[1]]] && IntegerQ@ Sqrt@ FromDigits@ RotateLeft@ id, AppendTo[lst, t]; Print@t], {n, 44000000}]; lst - Robert G. Wilson v, Oct 14 2007
Select[Accumulate[Range[10^6]], IntegerQ[Sqrt[FromDigits[RotateLeft[IntegerDigits[#]]]]]&] (* The program generates the first 8 terms of the sequence. To generate more, increase the Range constant but the program may take a long time to run. *) (* Harvey P. Dale, Dec 29 2023 *)
|
|
CROSSREFS
|
|
|
KEYWORD
|
base,nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|