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 #6 Sep 18 2015 04:04:26
%S 0,2,5,7,12,19,23,29,40,53,61,78,97,120,140,158,187,218,234,271,312,
%T 355,402,444,497,556,617,649,716,787,860,939,993,1076,1165,1262,1363,
%U 1466,1573,1682,1795,1905,2005,2132,2196,2327,2464,2603,2752,2903,3060,3223
%N Row sums of terms > 1 in A137152.
%p A000961 := proc(n) option remember ; local a; if n = 1 then 1; else for a from procname(n-1)+1 do if nops( ifactors(a)[2] ) = 1 then RETURN(a); fi; od: fi; end: A025473 := proc(n) option remember ; if n <= 2 then n; else ifactors( A000961(n))[2] ; op(1,op(1,%)) ; fi; end: A137152 := proc(n) option remember ; local a,m,i; if n = 1 then RETURN([1]) ; else a := procname(n-1) ; m := A025473(n) ; for i from 1 to nops(a) do if gcd(op(i,a),m) <> 1 then m := m*op(i,a) ; a := subsop(i=1,a) ; fi; od; a := [op(a),m] ; fi; RETURN(a) ; end: A135525 := proc(n) local a,k,i ; a := 0 ; k :=A137152(n) ; for i in k do if i <> 1 then a := a+i; fi; od; a ; end: for n from 1 to 80 do printf("%d,",A135525(n)) ; od: # _R. J. Mathar_, Dec 17 2008
%Y Cf. A137152.
%K nonn
%O 1,2
%A _Mats Granvik_, Feb 19 2008
%E More terms from _R. J. Mathar_, Dec 17 2008