Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A048612
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A048612
%S A048612 0,5,17,45,115,67,2205,2933,166667,44445,245795,6667,132683733,4444445,
%T A048612 2012917,23767083,2680575317,666667,555555555555555555,83053525,
%U A048612 3263104267,12488376483,5555555555555555555555,66666667,2952525627555
%N 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.
%C A048612 Least solutions for 'Difference between two squares is a repunit of length 
               n'.
%D A048612 David Wells, "Curious and Interesting Numbers", Revised Ed. 1997, Penguin 
               Books, p. 119. ISBN 0-14-026149-4.
%H A048612 H. Havermann, <a href="http://chesswanks.com/pxp/RSD.html">Repunit Square 
               Differences (gives many more terms)</a>
%e A048612 For n=2, 6^2-5^2=11.
%t A048612 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]
%Y A048612 Cf. A048611, A000042, A002275.
%Y A048612 Sequence in context: A163424 A099451 A133252 this_sequence A147050 A147397 
               A147193
%Y A048612 Adjacent sequences: A048609 A048610 A048611 this_sequence A048613 A048614 
               A048615
%K A048612 nonn,nice
%O A048612 0,2
%A A048612 Felice Russo (felice.russo(AT)katamail.com)
%E A048612 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 November 30 13:13 EST 2009. Contains 167758 sequences.


AT&T Labs Research