cp's OEIS Frontend

A282098 a(n) = A006530(a(n-1)) + A006530(a(n-2)) + A006530(a(n-3)) with a(0) = a(1) = a(2) = 1.

%I A282098 #30 Feb 10 2017 20:15:34
%S A282098 1,1,1,3,5,9,11,19,33,41,71,123,153,129,101,161,167,291,287,305,199,
%T A282098 301,303,343,151,259,195,201,117,93,111,81,71,111,111,145,103,169,145,
%U A282098 145,71,129,143,127,183,201,255,145,113,159,195,179,245,199,385,217,241,283,555,561,337,391,377,389,441
%N A282098 a(n) = A006530(a(n-1)) + A006530(a(n-2)) + A006530(a(n-3)) with a(0) = a(1) = a(2) = 1.
%C A282098 See also graph of this sequence.
%H A282098 Robert Israel, <a href="/A282098/b282098.txt">Table of n, a(n) for n = 0..1000</a>
%F A282098 a(n) = a(n+212) for n >= 89. - _Robert Israel_, Feb 06 2017
%e A282098 a(6) = 11 because A006530(3) + A006530(5) + A006530(9) = 3 + 5 + 3 = 11.
%p A282098 for i from 0 to 2 do A[i]:= 1: G[i]:= 1 od:
%p A282098 for i from 3 to 303 do
%p A282098   A[i]:= G[i-1]+G[i-2]+G[i-3];
%p A282098   G[i]:= max(numtheory:-factorset(A[i]));
%p A282098 od:
%p A282098 seq(A[i],i=1..303); # _Robert Israel_, Feb 06 2017
%t A282098 a[0] = a[1] = a[2] = 1; a[n_] := a[n] = FactorInteger[a[n - 1]][[-1, 1]] + FactorInteger[a[n - 2]][[-1, 1]] + FactorInteger[a[n - 3]][[-1, 1]]; Table[a@ n, {n, 0, 64}] (* _Michael De Vlieger_, Feb 07 2017 *)
%Y A282098 Cf. A000213, A006530, A116917, A177904.
%K A282098 nonn,easy,look
%O A282098 0,4
%A A282098 _Altug Alkan_, Feb 06 2017