Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A056661
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A056661 Numbers n such that 40*R_n + 3 is prime, where R_n = 11...1 is the repunit (A002275) of length n. +0
2
0, 1, 2, 5, 8, 11, 29, 31, 182, 296, 491 (list; graph; listen)
OFFSET

1,3

COMMENT

Also numbers n such that (4*10^(n+1)-13)/9 is prime.

LINKS

Index entries for primes involving repunits

MATHEMATICA

Do[ If[ PrimeQ[ 40*(10^n - 1)/9 + 3], Print[n]], {n, 0, 5000}]

CROSSREFS

Sequence in context: A129300 A107679 A018846 this_sequence A135050 A004112 A024815

Adjacent sequences: A056658 A056659 A056660 this_sequence A056662 A056663 A056664

KEYWORD

hard,more,nonn

AUTHOR

Robert G. Wilson v (rgwv(AT)rgwv.com), Aug 09 2000

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 21 18:23 EST 2009. Contains 167309 sequences.


AT&T Labs Research