|
| |
|
|
A048612
|
|
Find smallest pair (x,y) such that x^2-y^2 = 11...1 (n times) = (10^n-1)/9; sequence gives value of y.
|
|
2
| |
|
|
0, 5, 17, 45, 115, 67, 2205, 2933, 166667, 44445, 245795, 6667, 132683733, 4444445, 2012917, 23767083, 2680575317, 666667, 555555555555555555, 83053525, 3263104267, 12488376483, 5555555555555555555555, 66666667, 2952525627555
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,2
|
|
|
COMMENTS
| Least solutions for 'Difference between two squares is a repunit of length n'.
|
|
|
REFERENCES
| David Wells, "Curious and Interesting Numbers", Revised Ed. 1997, Penguin Books, p. 119. ISBN 0-14-026149-4.
|
|
|
LINKS
| H. Havermann, Repunit Square Differences (gives many more terms)
|
|
|
EXAMPLE
| For n=2, 6^2-5^2=11.
|
|
|
MATHEMATICA
| s = Flatten[Table[r = (10^i - 1)/9; d = Divisors[r]; p = d[[Length[d]/2]]; Solve[{x - y == p, x + y == r/p}, {y, x}], {i, 2, 56}]]; Prepend[Cases[s, Rule[y, n_] -> n], 0]
|
|
|
CROSSREFS
| Cf. A048611, A000042, A002275.
Sequence in context: A099451 A174794 A133252 * A147050 A147397 A147193
Adjacent sequences: A048609 A048610 A048611 * A048613 A048614 A048615
|
|
|
KEYWORD
| nonn,nice
|
|
|
AUTHOR
| Felice Russo (frusso(AT)micron.com)
|
|
|
EXTENSIONS
| Corrected and extended by Patrick De Geest (pdg(AT)worldofnumbers.com), Jun 15 1999. More terms from Hans Havermann (gladhobo(AT)teksavvy.com), Jul 02 2000.
|
| |
|
|
