Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A145873
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A145873 Smallest k such that k^2+1 is divisible by A002144(n)^9. +0
3
280182, 822557039, 24306922095, 4563230639355, 15069267560119, 112076323050317, 50928660480181, 3138611770750343, 9110883894036198, 50251663587824641, 76004727767164666, 310872228812491206, 521749964271465 (list; graph; listen)
OFFSET

1,1

EXAMPLE

a(1) = 280182 since A002144(1) = 5, 280182^2+1 = 78501953125 = 5^9*40193 and for no k < 280182 does 5^9 divide k^2+1. a(3) = 24306922095 since A002144(3) = 17, 24306922095^2+1 = 590826461732399189026 = 2*17^9*29*673*127637 and for no k < 24306922095 does 17^9 divide k^2+1.

CROSSREFS

Cf. A002144 (primes of form 4n+1), A002313 (-1 is a square mod p), A059321, A145296, A145297, A145298, A145299, A145871, A145872.

Sequence in context: A017467 A017599 A111750 this_sequence A131263 A096519 A157112

Adjacent sequences: A145870 A145871 A145872 this_sequence A145874 A145875 A145876

KEYWORD

nonn

AUTHOR

Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), Oct 30 2008

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 16 13:01 EST 2009. Contains 170825 sequences.


AT&T Labs Research