

A132345


Number of increasing threeterm geometric sequences from the integers {1,2,...,n}.


10



0, 0, 0, 1, 1, 1, 1, 2, 4, 4, 4, 5, 5, 5, 5, 8, 8, 10, 10, 11, 11, 11, 11, 12, 16, 16, 18, 19, 19, 19, 19, 22, 22, 22, 22, 27, 27, 27, 27, 28, 28, 28, 28, 29, 31, 31, 31, 34, 40, 44, 44, 45, 45, 47, 47, 48, 48, 48, 48, 49, 49, 49, 51, 58, 58, 58, 58, 59, 59, 59, 59, 64, 64, 64, 68
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,8


COMMENTS



LINKS



FORMULA

a(n)=sum_{1<p^2<=n} phi(p)trunc(n/p^2) where phi is Euler's phi function and trunc is the greatest integer function.


EXAMPLE

a(24)=12 as the sequences counted are 1,2,4; 2,4,8; 3,6,12; 4,8,16; 5,10,20; 6,12,24; 1,3,9; 2,6,18; 4,6,9; 8,12,18; 1,4,16; 9,12,16


MAPLE

sum(numtheory[phi](p)*trunc(n/p^2), p=2..trunc(sqrt(n)));


PROG

(Haskell)
a132345 n = sum $ zipWith (*)
(tail a000010_list) (map ((div n) . (^ 2)) [2..a000196 n])


CROSSREFS



KEYWORD

easy,nonn


AUTHOR

David Angell (angell(AT)maths.unsw.edu.au), Nov 07 2007


STATUS

approved



