login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A301646 Numbers k at which A062776(k) reaches a record high. 0
1, 2, 4, 6, 10, 12, 14, 18, 24, 30, 42, 54, 60, 66, 70, 78, 84, 90, 114, 120, 126, 150, 168, 180, 210, 270, 294, 300, 330, 390, 420, 462, 510, 546, 570, 630, 660, 714, 770, 780, 840, 924, 990, 1050, 1170, 1260, 1320, 1386, 1470, 1560, 1638 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
EXAMPLE
A062776(6) = 576, larger than any A062776(k) for 1 <= k < 6 so 6 is in the sequence.
MATHEMATICA
With[{s = Table[GCD[(n + 2)!, n^n], {n, 1700}]}, Map[FirstPosition[s, #][[1]] &, Union@ FoldList[Max, s]]] (* Michael De Vlieger, Mar 26 2018 *)
PROG
(PARI) val(n, p) = my(r=0); while(n, r+=n\=p); r
A062776(n) = my(f = factor(n)[, 1]~); prod(i=1, #f, f[i] ^ min(n, val(n + 2, f[i])))
upto(n) = my(r = 0, res = List(), c); for(i = 1, n, c = A062776(i); if(c > r, r = c; listput(res, i))); res
CROSSREFS
Cf. A062776.
Sequence in context: A339331 A255056 A164875 * A024892 A087136 A015921
KEYWORD
nonn,easy
AUTHOR
David A. Corneth, Mar 25 2018
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 16:40 EDT 2024. Contains 371916 sequences. (Running on oeis4.)