Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A118336
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A118336 a(n)= greatest multiple of (p(n+1)-p(n)) which is < p(n), where p(m) is the m-th prime. +0
2
1, 2, 4, 4, 10, 12, 16, 16, 18, 28, 30, 36, 40, 40, 42, 48, 58, 60, 64, 70, 72, 76, 78, 88, 96, 100, 100, 106, 108, 112, 124, 126, 136, 130, 148, 150, 156, 160, 162, 168, 178, 180, 190, 192, 196, 192, 204, 220, 226, 228, 228, 238, 240, 246, 252, 258, 268, 270, 276 (list; graph; listen)
OFFSET

1,2

COMMENT

A118335(n) - a(n) = 2 *(p(n+1) -p(n)). A113709(n) - a(n) = p(n+1) -p(n), for n>= 2.

FORMULA

a(1)=1; a(n)=[p(n+1)-p(n)]*floor(p(n)/[p(n+1)-p(n)]) for n>=2. - Emeric Deutsch (deutsch(AT)duke.poly.edu), Apr 27 2006

MAPLE

a:=n->(ithprime(n+1)-ithprime(n))*floor(ithprime(n)/(ithprime(n+1)-ithprime(n))): 1, seq(a(n), n=2..64); - Emeric Deutsch (deutsch(AT)duke.poly.edu), Apr 27 2006

CROSSREFS

Cf. A113709, A118335.

Sequence in context: A038043 A126138 A054764 this_sequence A121049 A056415 A000936

Adjacent sequences: A118333 A118334 A118335 this_sequence A118337 A118338 A118339

KEYWORD

nonn

AUTHOR

Leroy Quet (qq-quet(AT)mindspring.com), Apr 25 2006

EXTENSIONS

More terms from Emeric Deutsch (deutsch(AT)duke.poly.edu), Apr 27 2006

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 18 20:14 EST 2008. Contains 147244 sequences.


AT&T Labs Research