Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A132192
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A132192 Least number k such that 4*(k*(2^p-1))^2 + 1 is prime where 2^p-1 is a Mersenne prime (p in A000043). +0
1
1, 1, 4, 3, 10, 7, 16, 36, 45, 3, 136, 45, 564, 19, 350, 1201, 197, 3547, 2020, 870, 2322, 4488 (list; graph; listen)
OFFSET

1,3

CROSSREFS

Cf. A000043.

Adjacent sequences: A132189 A132190 A132191 this_sequence A132193 A132194 A132195

Sequence in context: A131805 A103218 A107381 this_sequence A075563 A081617 A103252

KEYWORD

more,nonn

AUTHOR

Pierre CAMI (pierrecami(AT)tele2.fr), Nov 05 2007

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 May 16 23:01 EDT 2008. Contains 139884 sequences.


AT&T Labs Research