A076566 Greatest prime divisor of 3n+3 (sum of three successive integers).

3, 3, 3, 5, 3, 7, 3, 3, 5, 11, 3, 13, 7, 5, 3, 17, 3, 19, 5, 7, 11, 23, 3, 5, 13, 3, 7, 29, 5, 31, 3, 11, 17, 7, 3, 37, 19, 13, 5, 41, 7, 43, 11, 5, 23, 47, 3, 7, 5, 17, 13, 53, 3, 11, 7, 19, 29, 59, 5, 61, 31, 7, 3, 13, 11, 67, 17, 23, 7, 71, 3, 73, 37, 5, 19, 11, 13, 79, 5, 3, 41, 83, 7

Offset: 1

Author

Zak Seidov, Oct 19 2002

Keywords

• easy
• nonn

Comments

a(n) = A006530(A000082(n+1)). - Reinhard Zumkeller, Oct 03 2012

Links

• Reinhard Zumkeller, Table of n, a(n) for n = 1..10000

Crossrefs

Cf. A008585.

Programs

Haskell

a076566 = a006530 . (* 3) . (+ 1)  -- Reinhard Zumkeller, Oct 03 2012

Mathematica

FactorInteger[Total[#]][[-1,1]]&/@Partition[Range[100],3,1]  (* Harvey P. Dale, Apr 03 2011 *)