|
Search: id:A114047
|
|
|
| A114047 |
|
x such that x^2 - 13*y^2 = 1. |
|
+0
1
|
|
| 1, 649, 842401, 1093435849, 1419278889601, 1842222905266249, 2391203911756701601, 3103780835237293411849, 4028705132934095091878401, 5229256158767620191964752649, 6787570465375238075075157060001
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
This sequence is computed with g(1e9,13) in the pari program.
A pellian equation (Pell's equation) - Benoit Cloitre (benoit7848c(AT)orange.fr), Feb 03 2006
|
|
LINKS
|
Tanya Khovanova, Recursive Sequences
Author?, Title?
John Robertson, Home page.
|
|
FORMULA
|
a(0)=1, a(1)=649 then a(n)=1298*a(n-1)-a(n-2) - Benoit Cloitre (benoit7848c(AT)orange.fr), Feb 03 2006
|
|
EXAMPLE
|
(649^2-1)/13 = 180^2
|
|
PROGRAM
|
(PARI) g(n, k) = for(y=0, n, x=k*y^2+1; if(issquare(x), print1(floor(sqrt(x))", ")))
(PARI) a0=1; a1=649; for(n=2, 30, a2=1298*a1-a0; a0=a1; a1=a2; print1(a2, ", ")) (Cloitre)
|
|
CROSSREFS
|
Sequence in context: A034619 A035755 A107551 this_sequence A035851 A110836 A043605
Adjacent sequences: A114044 A114045 A114046 this_sequence A114048 A114049 A114050
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Cino Hilliard (hillcino368(AT)gmail.com), Feb 01 2006
|
|
EXTENSIONS
|
More terms from Benoit Cloitre (benoit7848c(AT)orange.fr), Feb 03 2006
|
|
|
Search completed in 0.002 seconds
|
