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 #17 May 13 2022 10:07:58
%S 1,6,72,120,1440,6720,28800,80640,483840,1612800,5806080,7096320,
%T 85155840,283852800,510935040,1476034560,7947878400,17712414720,
%U 29520691200,106274488320,354248294400,1653158707200,2125489766400,4817776803840,8029628006400,28906660823040
%N For those rows n of A249223 which are weakly increasing, let w(n) denote the maximal entry in the row: sequence gives values of n for which w(n) sets a new record.
%C This is a companion to A250071 (and is derived from the data for that sequence), which lists the first time k appears as a width.
%C The record values are 1, 2, 3, 4, 6, 8, 9, 12, 16, 18, 20, but more data is needed to identify this sequence.
%C The odd part of a(n) is A053624(n), n>=1. The record values 1, 2, 3, 4, 6, 8, 9, 12, 16, 18, 20, ... are the beginning of A053640. - _Hartmut F. W. Hoft_, Mar 29 2022
%F a(n) = 2^t(n) * A053624(n), n > 1, where t(n) is the largest exponent satisfying 2^t(n) < A053624(n) and A053624(n) is the odd part of a(n) - see the comment in A250071. - _Hartmut F. W. Hoft_, Mar 29 2022
%e a(4) = 120 = 2^3 * A053624(4) = 2^3 * 15 and a(7) = 28800 = 2^7 * A053624(7) = 2^7 * 225. - _Hartmut F. W. Hoft_, Mar 29 2022
%t prevPower2[k_] := If[k==1, 1, 2^(Ceiling[Log[2, k]]-1)]
%t a340506[n_] := Module[{recL={{1, 1}}, q, d, pp}, For[q=1, q<=n, q+=2, d=DivisorSigma[0, q]; pp=prevPower2[q] q; If[First[Last[recL]]<d, AppendTo[recL, {d, pp }]]]; Last[Transpose[recL]]]
%t a340506[10000000] (* _Hartmut F. W. Hoft_, Mar 29 2022 *)
%Y Cf. A237270, A237593, A249223, A250068, A250070, A250071.
%Y Cf. A053624, A053640.
%K nonn,more
%O 1,2
%A _N. J. A. Sloane_, Jan 23 2021
%E a(12)-a(26) from _Hartmut F. W. Hoft_, Mar 29 2022