Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A109909
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A109909 a(n) = number of primes of the form k*(n-k)-1. +0
3
0, 0, 0, 2, 2, 1, 2, 1, 4, 1, 3, 2, 3, 2, 3, 2, 4, 3, 5, 1, 10, 1, 5, 5, 4, 2, 6, 3, 5, 3, 9, 4, 11, 3, 5, 5, 5, 5, 14, 1, 6, 6, 7, 6, 11, 5, 8, 4, 15, 3, 13, 4, 10, 9, 6, 5, 11, 4, 12, 5, 13, 4, 12, 4, 6, 11, 13, 4, 12, 6, 15, 12, 9, 4, 9, 5, 10, 8, 10, 3, 28, 7, 11, 15, 6, 9, 20, 7, 20, 6, 17, 5, 23 (list; graph; listen)
OFFSET

1,4

COMMENT

Conjecture: a(n) > 0 for n > 3.

CROSSREFS

Cf. A109904, A109905, A026728, A109907, A109908.

Sequence in context: A106029 A105153 A000924 this_sequence A144387 A030768 A051480

Adjacent sequences: A109906 A109907 A109908 this_sequence A109910 A109911 A109912

KEYWORD

nonn

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Jul 15 2005

EXTENSIONS

More terms from David Wasserman (wasserma(AT)spawar.navy.mil), Aug 15 2005

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 17:18 EST 2009. Contains 170825 sequences.


AT&T Labs Research