Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A157474
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A157474 a(n)=16*n^2+n (n>0) +0
3
17, 66, 147, 260, 405, 582, 791, 1032, 1305, 1610, 1947, 2316, 2717, 3150, 3615, 4112, 4641, 5202, 5795, 6420, 7077, 7766, 8487, 9240, 10025, 10842, 11691, 12572, 13485, 14430, 15407, 16416, 17457, 18530, 19635, 20772, 21941, 23142, 24375, 25640 (list; graph; listen)
OFFSET

1,1

COMMENT

If A=[A157474] 16*n.^2+n (17,66,147,260,.,); Y=[A157475] 512*n+16 (528,1040,1552,2064..,); X=[A157476] 2048*n^2+128*n+1 (2177,8449,18817,.,) ; , we have for all terms, Pell's equation X^2-A*Y^2=1. Example: 2177^2-17*528^2=1; 8449^2-66*1040^2=1; 18817^2-147*1552^2=1.

LINKS

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

FORMULA

a(n)=16*n^2+n (n>0)

EXAMPLE

For n=1, a(n)=17; n=2, a(2)=66; n=3, a(3)=147

CROSSREFS

Cf. A157475, A157476

Sequence in context: A115295 A065011 A031432 this_sequence A024215 A095071 A095072

Adjacent sequences: A157471 A157472 A157473 this_sequence A157475 A157476 A157477

KEYWORD

nonn

AUTHOR

Vincenzo Librandi (vincenzo.librandi(AT)tin.it), Mar 01 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 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research