Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A076338
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A076338
%S A076338 1,513,1025,1537,2049,2561,3073,3585,4097,4609,5121,5633,6145,6657,
%T A076338 7169,7681,8193,8705,9217,9729,10241,10753,11265,11777,12289,12801,
%U A076338 13313,13825,14337,14849,15361,15873,16385,16897,17409,17921,18433
%N A076338 512*n + 1.
%C A076338 First prime is a(15) = 7681, see A076339.
%C A076338 If A=[A031710] 256*n.^2+n (n>0, 257, 1026, 2307,. ,.,); Y=[A010871] 32 
               (32, 32, 32,..,); X=[A076338] 512*n+1 (n>0, 513, 1025, 1537, ,. .,
               ), we have, for all terms, Pell's equation X^2-A*Y^2=1. Example: 
               513^2-257 *32^2=1; 1025^2-1026*32^2=1; 1537^2-2307*32^2=1. [From 
               Vincenzo Librandi (vincenzo.librandi(AT)tin.it), Mar 11 2009]
%H A076338 Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/
               RecursiveSequences.html">Recursive Sequences</a>
%Y A076338 Cf. A031710, A010871 [From Vincenzo Librandi (vincenzo.librandi(AT)tin.it), 
               Mar 11 2009]
%Y A076338 Sequence in context: A015931 A060947 A066697 this_sequence A111344 A017681 
               A013957
%Y A076338 Adjacent sequences: A076335 A076336 A076337 this_sequence A076339 A076340 
               A076341
%K A076338 nonn
%O A076338 0,2
%A A076338 Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Oct 07 2002

    
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 8 08:31 EST 2009. Contains 170430 sequences.


AT&T Labs Research