Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #35 Nov 07 2017 03:20:44
%S 2,4,9,121,301,441,468,3171,8373,13440,16641,16804,83161,100652,
%T 133200,367428,395640,459680,701823,3739690,4238314,6698616,9014248,
%U 12301860,16956850,22230514,54889200,60676144,84983056,116648892,128942664
%N List of numbers n such that A039655(n) reaches a new record high.
%C Naively, one might have expected these numbers to have some other distinguishing property (primorials, perhaps), but that seems not to be the case.
%C Increasingly many of the values are of the form m*p with a (large) prime p and a smooth m, often m = 2^k (for a(n), n = 12, 14, 21, 23, 26, 28, 29, ...) or m = 2^k*3^k' (n = 7, 9, 19, 22, 30, ...) or m = 2^k*5^k' (n = 20, 25, ...). I conjecture that almost all terms are even. Also, for most terms (n = 1, 2, 3, 4, 5, 7, 10, 12, 14, 15, 16, 17, 19, 20, 21, 23, 24, 25, 26, 29, 30, 31, ...), either a(n)-1 or a(n)+1 has at most 2 prime divisors. - _M. F. Hasler_, Sep 25 2017
%H Hugo Pfoertner, <a href="/A292114/b292114.txt">Table of n, a(n) for n = 1..48</a>
%H N. J. A. Sloane, Three (No, 8) Lovely Problems from the OEIS, Experimental Mathematics Seminar, Rutgers University, Oct 05 2017, <a href="https://vimeo.com/237029685">Part I</a>, <a href="https://vimeo.com/237030304">Part 2</a>, <a href="https://oeis.org/A290447/a290447_slides.pdf">Slides.</a> (Mentions this sequence)
%o (PARI) m=-n=1;until(print1(n","),until(A039655(n++)>m,);m=A039655(n)) \\ _M. F. Hasler_, Sep 25 2017
%Y Cf. A039654, A039655, A292115.
%K nonn
%O 1,1
%A _N. J. A. Sloane_, Sep 22 2017
%E More terms from _Hugo Pfoertner_, Sep 22 2017