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

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

Terms

    a(0) =38606a(1) =38606a(2) =38606a(3) =8a(4) =48a(5) =48a(6) =192a(7) =192a(8) =304a(9) =96a(10) =16a(11) =304a(12) =304a(13) =72a(14) =44a(15) =160a(16) =1170558326a(17) =160a(18) =96a(19) =128a(20) =190a(21) =392472a(22) =1980a(23) =6560a(24) =3304a(25) =32a(26) =6560a(27) =6560a(28) =114a(29) =22348

External references