Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A048611
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A048611 Find smallest pair (x,y) such that x^2-y^2 = 11...1 (n times) = (10^n-1)/9; sequence gives value of x. +0
3
1, 6, 20, 56, 156, 340, 2444, 4440, 167000, 55556, 267444, 333400, 132687920, 5555556, 10731400, 40938800, 2682647040, 333334000, 555555555555555556, 3334367856, 11034444280, 35595935980, 5555555555555555555556 (list; graph; listen)
OFFSET

0,2

COMMENT

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[x, n_] -> n], 1]

CROSSREFS

Cf. A048612, A000042, A002275.

Sequence in context: A109903 A014480 A048778 this_sequence A127982 A109164 A027984

Adjacent sequences: A048608 A048609 A048610 this_sequence A048612 A048613 A048614

KEYWORD

nonn,nice

AUTHOR

Felice Russo (felice.russo(AT)katamail.com)

EXTENSIONS

Corrected and extended by Patrick De Geest (pdg(AT)worldofnumbers.com), Jun 15 1999. More terms from Hans Havermann (pxp(AT)rogers.com), Jul 02 2000

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 1 19:22 EST 2009. Contains 167811 sequences.


AT&T Labs Research