|
%I #12 Apr 29 2018 12:00:21
%S 1,5,7,9,11,13,17,19,21,23,25,29,31,33,37,41,43,46,47,49,51,53,55,57,
%T 59,61,65,67,69,71,73,77,79,81,82,83,85,89,91,93,97,101,103,106,107,
%U 109,111,113,115,118,121,125,127,129,131,133,137,139,141,145,149,151,153,155,157,161,163,166,167,169,171,173,175
%N List of starts of nondecreasing runs of values of d(n) (the divisor function A000005(n)).
%H Seiichi Manyama, <a href="/A303578/b303578.txt">Table of n, a(n) for n = 1..10000</a>
%o (AWK) # Assume that b.txt contains a b-file for A000005
%o awk ' BEGIN {i = 1; print i}
%o {if ($2 < i) print $1; i = $2} ' b.txt >out
%Y Cf. A000005.
%Y A303577 gives the lengths of the successive runs.
%Y A284597(m) is the smallest number that starts a run of length m.
%K nonn
%O 1,2
%A _N. J. A. Sloane_, Apr 29 2018
|
