Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A070221
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A070221 a(n)=LPF(n+1)-LPF(n), where LPF(n) denotes the largest prime factor of n. +0
2
1, -1, 3, -2, 4, -5, 1, 2, 6, -8, 10, -6, -2, -3, 15, -14, 16, -14, 2, 4, 12, -20, 2, 8, -10, 4, 22, -24, 26, -29, 9, 6, -10, -4, 34, -18, -6, -8, 36, -34, 36, -32, -6, 18, 24, -44, 4, -2, 12, -4, 40, -50, 8, -4, 12, 10, 30, -54, 56, -30, -24, -5, 11, -2, 56, -50, 6, -16, 64, -68, 70, -36, -32, 14, -8, 2, 66, -74, -2, 38, 42, -76 (list; graph; listen)
OFFSET

2,3

EXAMPLE

a(12) = LPF(13)-LPF(12) = 13 - 3 = 10.

MATHEMATICA

g[n_] := Module[{a, b}, a = FactorInteger[n]; b = Length[a]; a[[b]][[1]]]; f[n_] := g[n + 1] - g[n]; Table[f[i], {i, 2, 100}]

CROSSREFS

Sequence in context: A095401 A073369 A021759 this_sequence A020814 A128440 A063201

Adjacent sequences: A070218 A070219 A070220 this_sequence A070222 A070223 A070224

KEYWORD

sign

AUTHOR

Joseph L. Pe (joseph_l_pe(AT)hotmail.com), May 07 2002

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 10 00:48 EST 2009. Contains 170565 sequences.


AT&T Labs Research