|
%I #8 Oct 29 2017 21:11:31
%S 1,2,4,6,9,12,16,20,24,28,32,36,41,46,51,56,61,66,71,76,81,86,91,96,
%T 102,108,114,120,127,134,141,148,155,162,169,176,183,190,197,204,211,
%U 218,225,232,239,246,253,260,267,274,281,288,295,302,309,316,323,330,337
%N a(1)=1. a(n+1) = a(n) + (number of terms, from among the first n terms of the sequence, which occur among (d(a(1)),d(a(2)),d(a(3)),...d(a(n))), where d(n) = A000005(n)).
%H G. C. Greubel, <a href="/A105434/b105434.txt">Table of n, a(n) for n = 1..5000</a>
%t f[l_] := Append[l, l[[ -1]] + Count[MemberQ[l, # ] & /@ Union@DivisorSigma[0, l], True]]; Nest[f, {1}, 58]
%Y Cf. A000005. A variant of A130798.
%K nonn
%O 1,2
%A _Robert G. Wilson v_, Aug 26 2007
|
