%I #15 Aug 25 2015 02:39:03
%S 1,1,1,2,1,3,1,3,1,5,1,2,4,1,7,1,2,3,6,1,3,9,1,3,9,1,11,1,3,9,1,2,5,
%T 10,1,2,7,14,1,13,1,2,4,8,16,1,11,1,2,3,4,6,12,1,7,1,2,4,5,10,20,1,2,
%U 7,14,1,3,5,15,1,23,1,2,4,8,16,1,17,1,2,13,26
%N Table read by rows in which row n lists the positive divisors of A130157(n).
%e Triangle starts:
%e 1;
%e 1;
%e 1, 2;
%e 1, 3;
%e 1, 3;
%e 1, 5;
%e 1, 2, 4;
%e 1, 7;
%e 1, 2, 3, 6;
%e ...
%p A130158 := proc(nmax) local a130157,a,n,anext,i ; a130157 := [1] ; a := [] ; while nops(a) < nmax do n := nops(a130157)+1 ; a := [op(a),op(numtheory[divisors](op(-1,a130157)))] ; anext :=0 ; for i from 1 to nops(a130157) do if gcd(op(i,a130157),op(n-1,a)) = 1 then anext := anext+1 ; fi ; od ; a130157 := [op(a130157),anext] ; od ; RETURN(a) ; end: A130158(80) ; # _R. J. Mathar_, Jun 12 2007
%Y Cf. A130157.
%K nonn,tabf
%O 1,4
%A _Leroy Quet_, May 13 2007
%E More terms from _R. J. Mathar_, Jun 12 2007
%E Edited by _Charles R Greathouse IV_, Apr 30 2010
%E Edited by _N. J. A. Sloane_, May 09 2010
|