Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A082462
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A082462 Let chi(k) = 1 if prime(k+1) - prime(k) = 2, = 0 otherwise; sequence gives a(n) = sum_{k <= n} chi(k). +0
4
0, 1, 2, 2, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 6, 7, 7, 7, 8, 8, 8, 8, 8, 8, 9, 9, 10, 10, 10, 10, 10, 11, 11, 12, 12, 12, 12, 12, 12, 13, 13, 14, 14, 15, 15, 15, 15, 16, 16, 16, 17, 17, 17, 17, 17, 18, 18, 18, 19, 19, 19, 19, 20, 20, 20, 20, 20, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21 (list; graph; listen)
OFFSET

1,3

FORMULA

a(n)=A071538(A000040(n)). [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Oct 06 2008]

EXAMPLE

n p D a(n) (p=prime(n), D = prime(n+1)-prime(n))

1 2 1 0

2 3 2 1

3 5 2 2

4 7 4 2

5 11 2 3

6 13 4 3

CROSSREFS

Cf. A000040, A001223.

Adjacent sequences: A082459 A082460 A082461 this_sequence A082463 A082464 A082465

Sequence in context: A067085 A055086 A001462 this_sequence A005041 A030530 A024417

KEYWORD

nonn,new

AUTHOR

Artemario Tadeu Medeiros da Silva (artemario(AT)uol.com.br), Apr 26 2003

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 October 15 09:18 EDT 2008. Contains 145015 sequences.


AT&T Labs Research