login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A014666
Erroneous version of A027435.
0
1, 2, 4, 6, 10, 11, 17, 21, 27, 29, 39, 42, 54, 58, 63, 71, 87, 90, 108, 114, 121, 126
OFFSET
1,2
COMMENTS
Former title: Partial sums of A014665. - Sean A. Irvine, Nov 15 2018
REFERENCES
S. W. Golomb, personal communication, Svalbard, Norway, 7/97.
FORMULA
For n>1: # of positive integers u <= n(n-1) such that p^H_p(u)<=n for all p<=u, where H_p(u) = highest power of p dividing u.
CROSSREFS
Sequence in context: A086917 A004789 A027435 * A067852 A253968 A102025
KEYWORD
dead
AUTHOR
STATUS
approved