Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A157366
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A157366 a(n)=686*n+14 (n>0) +0
3
700, 1386, 2072, 2758, 3444, 4130, 4816, 5502, 6188, 6874, 7560, 8246, 8932, 9618, 10304, 10990, 11676, 12362, 13048, 13734, 14420, 15106, 15792, 16478, 17164, 17850, 18536, 19222, 19908, 20594, 21280, 21966, 22652, 23338, 24024, 24710 (list; graph; listen)
OFFSET

1,1

COMMENT

If A=[A157365] 49*n.^2+2*n (51,200,447,792,...,); Y=[A157366] 686*n+14 (700, 1386, 2072,2758,...,); X=[A157367] 4802*n^2+196*n+1 (4999,19601,43807,77617,...,) ; , we have for all terms, Pell's equation X^2-A*Y^2=1. Example: 4999^2-51*700^2=1; 19601^2-200*1386^2=1; 43807^2-447*2072^2=1; 77617^2-792*2758^2=1.

LINKS

Vincenzo Librandi, X^2-AY^2=1

FORMULA

a(n)=686*n+14 (n>0)

EXAMPLE

For n=1, a(1)=700; n=2, a(2)=1386; n=3, a(3)=2072

CROSSREFS

Cf. A157365, A157367

Sequence in context: A028500 A133251 A116338 this_sequence A093270 A093235 A140433

Adjacent sequences: A157363 A157364 A157365 this_sequence A157367 A157368 A157369

KEYWORD

nonn

AUTHOR

Vincenzo Librandi (vincenzo.librandi(AT)tin.it), Feb 28 2009

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 29 12:46 EST 2009. Contains 167659 sequences.


AT&T Labs Research