Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A083551
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A083551 Least common multiple of 2 consecutive prime differences, of two successive terms of A001223. +0
2
2, 2, 4, 4, 4, 4, 4, 12, 6, 6, 12, 4, 4, 12, 6, 6, 6, 12, 4, 6, 12, 12, 24, 8, 4, 4, 4, 4, 28, 28, 12, 6, 10, 10, 6, 6, 12, 12, 6, 6, 10, 10, 4, 4, 12, 12, 12, 4, 4, 12, 6, 10, 30, 6, 6, 6, 6, 12, 4, 10, 70, 28, 4, 4, 28, 42, 30, 10, 4, 12, 24, 24, 6, 12, 12, 24, 8, 8, 40, 10, 10, 10, 6, 12 (list; graph; listen)
OFFSET

1,1

FORMULA

a(n)=lcm(A001223[n], A001223[n+1])

MATHEMATICA

f[x_] := Prime[x+1]-Prime[x] Table[LCM[f[w+1], f[w]], {w, 1, 128}]

CROSSREFS

Cf. A001223, A083538-A083555, A057467.

Adjacent sequences: A083548 A083549 A083550 this_sequence A083552 A083553 A083554

Sequence in context: A063511 A063095 A082852 this_sequence A080374 A035683 A001670

KEYWORD

nonn

AUTHOR

Labos E. (labos(AT)ana.sote.hu), May 22 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