Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A103273
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A103273 Number of ways of writing prime(n)-1 in the form prime(i)+prime(j). +0
1
0, 0, 1, 1, 2, 1, 2, 2, 3, 2, 3, 4, 3, 4, 4, 3, 4, 6, 6, 5, 6, 7, 5, 4, 7, 6, 8, 6, 8, 7, 10, 7, 5, 8, 5, 12, 11, 10, 6, 6, 7, 14, 8, 11, 9, 13, 19, 11, 7, 12, 7, 9, 18, 9, 8, 9, 9, 19, 16, 14, 16, 8, 15, 12, 17, 10, 24, 19, 9, 16, 10, 10, 18, 18, 22, 10, 9, 21, 14, 20, 11, 30, 14, 19, 21, 13, 13 (list; graph; listen)
OFFSET

1,5

FORMULA

a(n) = A061358(prime(n)-1). - David Wasserman (dwasserm(AT)earthlink.net), Oct 08 2005

EXAMPLE

11-1=3+7=5+5, so a(5)=2.

CROSSREFS

Adjacent sequences: A103270 A103271 A103272 this_sequence A103274 A103275 A103276

Sequence in context: A078661 A029263 A097575 this_sequence A025066 A051275 A025799

KEYWORD

nonn

AUTHOR

Yasutoshi Kohmoto (zbi74583(AT)boat.zero.ad.jp), Jan 27 2005

EXTENSIONS

More terms from David Wasserman (dwasserm(AT)earthlink.net), Oct 08 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 May 16 23:01 EDT 2008. Contains 139884 sequences.


AT&T Labs Research