Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A158803
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A158803 Numbers n such that n^2==2 (mod 41). +0
2
17, 24, 58, 65, 99, 106, 140, 147, 181, 188, 222, 229, 263, 270, 304, 311, 345, 352, 386, 393, 427, 434, 468, 475, 509, 516, 550, 557, 591, 598, 632, 639, 673, 680, 714, 721, 755, 762, 796, 803, 837, 844, 878, 885, 919, 926, 960, 967, 1001, 1008, 1042, 1049 (list; graph; listen)
OFFSET

1,1

FORMULA

a(n)^2==2 (mod 41).

a(n)=a(n-1)+a(n-2)-a(n-3).

a(n)=(1/4)*(41+27*(-1)^(n-1)+82*(n-1)).

First differences: a(2n)-a(2n-1) = 7. a(2n+1)-a(2n)=34.

G.f.: x*(17+7*x+17*x^2)/((1+x)*(x-1)^2). - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Apr 04 2009

EXAMPLE

a(1)^2 = 17^2 = 289 = 7*41+2 .

CROSSREFS

Sequence in context: A062628 A127907 A070687 this_sequence A051780 A124971 A105448

Adjacent sequences: A158800 A158801 A158802 this_sequence A158804 A158805 A158806

KEYWORD

nonn,easy

AUTHOR

Vincenzo Librandi (vincenzo.librandi(AT)tin.it), Mar 27 2009

EXTENSIONS

Comments translated to formulas, R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Apr 04 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 December 20 16:54 EST 2009. Contains 171081 sequences.


AT&T Labs Research