|
Search: id:A100387
|
|
|
| A100387 |
|
a(n) is the largest number x such that for m=n to n+x-1, A006530(m) decreases. |
|
+0
2
|
|
| 1, 2, 1, 2, 1, 2, 1, 1, 1, 2, 1, 4, 3, 2, 1, 2, 1, 2, 1, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 2, 1, 1, 3, 2, 1, 4, 3, 2, 1, 2, 1, 3, 2, 1, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 1, 1, 2, 1, 4, 3, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 3, 2, 1, 2, 1, 1, 3, 2, 1, 1, 2, 1, 1, 3, 2, 1, 2, 1, 1, 1, 1, 3, 2, 1, 2, 1, 2, 1, 2, 1, 3, 2, 1
(list; graph; listen)
|
|
|
OFFSET
|
2,2
|
|
|
COMMENT
|
A006530(m) is the largest prime factor of m.
|
|
EXAMPLE
|
a(13)=4 because the largest prime factors of 13,14,15,16 are 13,7,5,2; but A006530(17)=17.
|
|
MATHEMATICA
|
<<NumberTheory`NumberTheoryFunctions` mxp[x_] :=Max[PrimeFactorList[x]]; uph=Table[First[Flatten[Position[Sign[RotateLeft[Table[mxp[n+j], {j, 0, 15}]]-Table[mxp[n+j], {j, 0, 15}]], 1]]], {n, 1, 256}]
|
|
CROSSREFS
|
Cf. A006530, A070087, A071870, A100376, A100385, A100386.
Sequence in context: A063050 A057557 A103587 this_sequence A081129 A022934 A107450
Adjacent sequences: A100384 A100385 A100386 this_sequence A100388 A100389 A100390
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Labos E. (labos(AT)ana.sote.hu), Dec 10 2004
|
|
EXTENSIONS
|
Edited by Don Reble (djr(AT)nk.ca), Jun 13 2007
|
|
|
Search completed in 0.002 seconds
|
