cp's OEIS Frontend

A371213 Number of ordered factorizations of n into factors > 5.

%I A371213 #10 Jan 13 2025 16:28:08
%S A371213 1,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,
%T A371213 1,2,1,1,1,1,1,3,1,1,1,1,1,3,2,1,1,1,1,3,1,3,1,1,1,3,1,1,3,2,1,3,1,1,
%U A371213 1,3,1,5,1,1,1,1,3,3,1,3,2,1,1,5,1,1,1,3,1,5,3,1,1,1,1,5,1,3,3,2,1,3,1,3,3,1,1,5
%N A371213 Number of ordered factorizations of n into factors > 5.
%H A371213 Antti Karttunen, <a href="/A371213/b371213.txt">Table of n, a(n) for n = 1..20000</a>
%F A371213 a(1) = 1; a(n) = Sum_{d|n, n/d > 5} a(d).
%e A371213 a(42) = 3: 42 = 6*7 = 7*6.
%t A371213 a[n_] := a[n] = If[n == 1, n, Sum[If[n/d > 5, a[d], 0], {d, Divisors[n]}]]; Table[a[n], {n, 1, 96}]
%o A371213 (PARI)
%o A371213 memoA371213 = Map();
%o A371213 A371213(n) = if(1==n,1,my(v); if(mapisdefined(memoA371213,n,&v), v, v = sumdiv(n,d,if((n/d)<=5, 0, A371213(d))); mapput(memoA371213,n,v); (v))); \\ _Antti Karttunen_, Jan 13 2025
%Y A371213 Cf. A002033, A017900, A074206, A185326, A371209, A371211, A371212.
%K A371213 nonn
%O A371213 1,36
%A A371213 _Ilya Gutkovskiy_, Mar 15 2024
%E A371213 More terms from _Antti Karttunen_, Jan 13 2025