|
| |
|
|
A066619
|
|
Both n and its reverse are one less than a square.
|
|
1
| |
|
|
0, 3, 8, 99, 323, 575, 4224, 5775, 9999, 36863, 42024, 999999, 3055503, 3640463, 5597955, 8803088, 32855823, 99999999, 360696063, 422919224, 4227990528, 8250997224, 9999999999, 30485858403, 30536863503, 32154945123
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,2
|
|
|
COMMENTS
| Numbers ending in 0 are not included except 0. [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Mar 13 2010]
|
|
|
LINKS
| Harry J. Smith, Table of n, a(n) for n=1,...,55
|
|
|
EXAMPLE
| 4227990528 = 65023^2 - 1 and 8250997224 = 90835^2 - 1
|
|
|
MATHEMATICA
| dtn[L_] := Fold[10#1+#2&, 0, L] A={}; For[i=1, i>0, i++, t=dtn[Reverse[IntegerDigits[i^2-1]]]; If[IntegerQ[(t+1)^(1/2)]&&Mod[i^2, 10]=!=1, AppendTo[A, i^2-1]; Print[A]]]
okQ[n_]:=Module[{idn=IntegerDigits[n]}, Last[idn]!=0&& IntegerQ[Sqrt[ FromDigits[ Reverse[idn]]+1]]]; Join[{0}, Select[Range[180000]^2-1, okQ]] (* From Harvey P. Dale, Apr 11 2011 *)
|
|
|
PROG
| (PARI) Rev(x)= { local(d, r=0); while (x>0, d=x%10; x\=10; r=r*10 + d); return(r) } { n=0; for (m=0, 10^10, k=m^2 - 1; if (k%10 && issquare(Rev(k) + 1), if (m==0, k=0); write("b066619.txt", n++, " ", k); if (n==100, return)) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Mar 13 2010]
|
|
|
CROSSREFS
| Sequence in context: A069703 A114737 A099296 * A028504 A123279 A134803
Adjacent sequences: A066616 A066617 A066618 * A066620 A066621 A066622
|
|
|
KEYWORD
| base,nonn
|
|
|
AUTHOR
| Erich Friedman (efriedma(AT)stetson.edu), Jan 08 2002
|
|
|
EXTENSIONS
| More terms from Christopher Lund (clund(AT)san.rr.com), Apr 14 2002
OFFSET changed from 0,2 to 1,2 by Harry J. Smith (hjsmithh(AT)sbcglobal.net), Mar 13 2010
|
| |
|
|
