cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-2 of 2 results.

A135524 Row sums of A137152.

Original entry on oeis.org

1, 3, 6, 9, 14, 21, 26, 33, 44, 57, 66, 83, 102, 125, 146, 165, 194, 225, 242, 279, 320, 363, 410, 453, 506, 565, 626, 659, 726, 797, 870, 949, 1004, 1087, 1176, 1273, 1374, 1477, 1584, 1693, 1806, 1917, 2018, 2145, 2210, 2341, 2478, 2617, 2766, 2917, 3074
Offset: 1

Views

Author

Mats Granvik, Feb 19 2008

Keywords

Crossrefs

Cf. A137152.

Programs

  • Maple
    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: A135524 := proc(n) add(k,k=A137152(n)) ; end: for n from 1 to 80 do printf("%d,",A135524(n)) ; od: # R. J. Mathar, Dec 17 2008

Extensions

More terms from R. J. Mathar, Dec 17 2008

A135525 Row sums of terms > 1 in A137152.

Original entry on oeis.org

0, 2, 5, 7, 12, 19, 23, 29, 40, 53, 61, 78, 97, 120, 140, 158, 187, 218, 234, 271, 312, 355, 402, 444, 497, 556, 617, 649, 716, 787, 860, 939, 993, 1076, 1165, 1262, 1363, 1466, 1573, 1682, 1795, 1905, 2005, 2132, 2196, 2327, 2464, 2603, 2752, 2903, 3060, 3223
Offset: 1

Views

Author

Mats Granvik, Feb 19 2008

Keywords

Crossrefs

Cf. A137152.

Programs

  • Maple
    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

Extensions

More terms from R. J. Mathar, Dec 17 2008
Showing 1-2 of 2 results.