cp's OEIS Frontend

A074484 a(n) = b(A074483(n), n), where b(k) is the recursion: b(1,n)=1, b(k+1,n)=b(k,n) + (b(k,n) reduced mod(k+n)) (cf. A074482).

%I A074484 #11 Mar 30 2012 18:50:25
%S A074484 38606,38606,38606,8,48,48,192,192,304,96,16,304,304,72,44,160,
%T A074484 1170558326,160,96,128,190,392472,1980,6560,3304,32,6560,6560,114,
%U A074484 22348,6240,230,392472,5920,5920,5920,592362276,592362276,18154867024,18154867024
%N A074484 a(n) = b(A074483(n), n), where b(k) is the recursion: b(1,n)=1, b(k+1,n)=b(k,n) + (b(k,n) reduced mod(k+n)) (cf. A074482).
%C A074484 a(n) = A074482(n)*(A074483(n)+ n + 1).
%H A074484 David W. Wilson, <a href="/A074484/b074484.txt">Table of n, a(n) for n = 0..10000</a>
%e A074484 a(0) = A073117(A074483(0)) = A073117(397) = 38606.
%Y A074484 Cf. A074482, A074483, A073117.
%K A074484 nonn
%O A074484 0,1
%A A074484 _Reinhard Zumkeller_ and _Benoit Cloitre_, Aug 23 2002