|
Search: id:A122464
|
|
|
| A122464 |
|
Smooth Power Trios: The m-th number in the sequence, n, is part of the minimum trio of numbers n, n-1, and n-2 such that the highest prime factor of each number x <= floor(x^(1/m)) |
|
+0
3
|
|
| 4, 50, 134850, 116026275, 138982583000, 1348770149848002
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
The fifth term was found by R. Gerbicz, the others were found by F. Schneider
|
|
LINKS
|
Fred Schneider and R. Gerbicz, Smooth Power Trios.
|
|
EXAMPLE
|
Example: The 6th term:
1348770149848002 = 2 x 3 x 7 x 23 x 41 x 61^2 x 149 x 239 x 257
1348770149848001 = 19^3 x 89 x 103 x 229 x 283 x 331
1348770149848000 = 2^6 x 5^3 x 11 x 29 x 109 x 151 x 163 x 197
This satisfies because 331 <= floor(1348770149848000^(1/6)) = 332
|
|
PROGRAM
|
Program in C written by R. Gerbicz
|
|
CROSSREFS
|
Cf. A122463, A122465.
Adjacent sequences: A122461 A122462 A122463 this_sequence A122465 A122466 A122467
Sequence in context: A139087 A026865 A016078 this_sequence A048995 A000516 A000854
|
|
KEYWORD
|
hard,more,nonn,uned
|
|
AUTHOR
|
Fred Schneider (frederick.william.schneider(AT)gmail.com), Sep 09 2006
|
|
|
Search completed in 0.002 seconds
|
