Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A154998
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A154998 Primes p such that p^2 divides A048861((p-1)/2). +0
2
3, 2001907169 (list; graph; listen)
OFFSET

1,1

COMMENT

No other terms below 10^11.

FORMULA

Elements of A125854 congruent to 1 or 3 modulo 8, i.e., primes p such that p == 1 or 3 (mod 8) and 2^(p-1) == 1+p (mod p^2).

PROGRAM

(PARI) { forprime(p=3, 10^11, if(Mod((p-1)/2, p^2)^((p-1)/2)==1, print(p); )) }

CROSSREFS

A048861,A121999,A125854

Sequence in context: A081508 A067481 A058433 this_sequence A036236 A058447 A058453

Adjacent sequences: A154995 A154996 A154997 this_sequence A154999 A155000 A155001

KEYWORD

bref,hard,more,nonn

AUTHOR

Max Alekseyev (maxale(AT)gmail.com), Jan 18 2009

EXTENSIONS

Edited by Max Alekseyev (maxale(AT)gmail.com), Oct 13 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 9 18:50 EST 2009. Contains 170568 sequences.


AT&T Labs Research