login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A070221 a(n)=LPF(n+1)-LPF(n), where LPF(n) denotes the largest prime factor of n. 1
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; refs; listen; history; text; internal format)
OFFSET

2,3

LINKS

Table of n, a(n) for n=2..83.

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: A240541 A073369 A021759 * A020814 A286298 A128440

Adjacent sequences:  A070218 A070219 A070220 * A070222 A070223 A070224

KEYWORD

sign

AUTHOR

Joseph L. Pe, May 07 2002

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 18 17:32 EDT 2021. Contains 345120 sequences. (Running on oeis4.)