Hamming numbers: Difference between revisions

This is a basic implementation; finding the millionth term requires 1 second and 54 MB. Much better algorithms exist.

<syntaxhighlight lang="parigp">Hupto(n)={

for(m=2,n,

);

};

H(n)=Hupto(n)[n];