|
|
A088433
|
|
Number of ways to write n as n = u*v*w with 1<=u<=v<w.
|
|
6
|
|
|
0, 1, 1, 1, 1, 2, 1, 2, 1, 2, 1, 4, 1, 2, 2, 3, 1, 3, 1, 4, 2, 2, 1, 6, 1, 2, 2, 4, 1, 5, 1, 4, 2, 2, 2, 7, 1, 2, 2, 6, 1, 5, 1, 4, 4, 2, 1, 8, 1, 3, 2, 4, 1, 6, 2, 6, 2, 2, 1, 10, 1, 2, 4, 5, 2, 5, 1, 4, 2, 5, 1, 11, 1, 2, 3, 4, 2, 5, 1, 9, 3, 2, 1, 10, 2, 2, 2, 6, 1, 10, 2, 4, 2, 2, 2, 12, 1, 3, 4, 6
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,6
|
|
COMMENTS
|
a(n) = 1 iff n prime or n prime^2: a(A000430(n))=1.
|
|
LINKS
|
|
|
EXAMPLE
|
n=12: (1,1,12), (1,2,6), (1,3,4), (2,2,3): therefore a(12)=4;
n=18: (1,1,18), (1,2,9), (1,3,6): therefore a(18)=3.
|
|
PROG
|
(PARI) A088433(n) = { my(s=0); fordiv(n, u, for(v=u, n-1, for(w=v+1, n, if(u*v*w==n, s++)))); (s); }; \\ Antti Karttunen, Aug 24 2017
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|