login

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”).

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

%I #12 Nov 21 2013 12:47:54

%S 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,

%T 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,

%U 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

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

%C a(n) = A006530(A000082(n+1)). - _Reinhard Zumkeller_, Oct 03 2012

%H Reinhard Zumkeller, <a href="/A076566/b076566.txt">Table of n, a(n) for n = 1..10000</a>

%t FactorInteger[Total[#]][[-1,1]]&/@Partition[Range[100],3,1] (* _Harvey P. Dale_, Apr 03 2011 *)

%o (Haskell)

%o a076566 = a006530 . (* 3) . (+ 1) -- _Reinhard Zumkeller_, Oct 03 2012

%Y Cf. A008585.

%K easy,nonn

%O 1,1

%A _Zak Seidov_, Oct 19 2002