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.

A076928 a(1) = 1, a(n+1)= a(n)*(n+1) divided by the largest prime divisor of n+1.

Original entry on oeis.org

1, 1, 1, 2, 2, 4, 4, 16, 48, 96, 96, 384, 384, 768, 2304, 18432, 18432, 110592, 110592, 442368, 1327104, 2654208, 2654208, 21233664, 106168320, 212336640, 1911029760, 7644119040, 7644119040, 45864714240, 45864714240, 733835427840
Offset: 1

Views

Author

Amarnath Murthy, Oct 18 2002

Keywords

Crossrefs

Cf. A076929.

Programs

  • Maple
    a[1] := 1:for n from 2 to 100 do q := ifactors(n)[2]:a[n] := n*a[n-1]/q[nops(q)][1]: od:seq(a[j],j=1..100);
  • Mathematica
    nxt[{a_,b_}]:={a(b+1)/FactorInteger[b+1][[-1,1]],b+1}; Transpose[ NestList[ nxt[#]&,{1,1},40]][[1]] (* Harvey P. Dale, Aug 11 2011 *)

Extensions

Corrected and extended by Sascha Kurz, Jan 21 2003