Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A156840
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A156840 Positive a(n) >1 such that a(n)^2 == 1 ( mod 900 ). +0
6
199, 251, 449, 451, 649, 701, 899, 901, 1099, 1151, 1349, 1351, 1549, 1601, 1799, 1801, 1999, 2051, 2249, 2251, 2449, 2501, 2699, 2701, 2899, 2951, 3149, 3151, 3349, 3401, 3599, 3601, 3799, 3851, 4049, 4051, 4249, 4301, 4499, 4501, 4699, 4751, 4949, 4951 (list; graph; listen)
OFFSET

1,1

COMMENT

The sequence serves in the following solutions of Pell equations [optionally

replace 900 by (A010869(n))^2 to visualize the Pell format of the equations]:

( a(4n+1) )^2 - A156810(n+1)*900 = 1, n>=0.

( a(4n+2) )^2 - A156812(n+1)*900 = 1, n>=0.

( a(4n+3) )^2 - A156813(n+1)*900 = 1, n>=0.

( a(4n+4) )^2 - A156814(n+1)*900 = 1, n>=0.

LINKS

Vincenzo Librandi, X^2-AY^2=1 [From Vincenzo Librandi (vincenzo.librandi(AT)tin.it), Feb 20 2009]

FORMULA

a(n)=a(n-1)+a(n-4)-a(n-5). [R. J. Mathar, Aug 18 2009]

EXAMPLE

199^2-1==0 (mod 900). 251^2-1==0 (mod 900).

CROSSREFS

Cf. A156810, A156812, A156813, A156814, A010869 [From Vincenzo Librandi (vincenzo.librandi(AT)tin.it), Feb 20 2009]

Sequence in context: A106628 A109561 A031930 this_sequence A142232 A166459 A142682

Adjacent sequences: A156837 A156838 A156839 this_sequence A156841 A156842 A156843

KEYWORD

nonn

AUTHOR

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

EXTENSIONS

Edited and a(11) corrected by R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Aug 18 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 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research