|
|
A062762
|
|
Number of powerful numbers not exceeding 2^n.
|
|
2
|
|
|
1, 1, 2, 3, 5, 8, 11, 18, 26, 38, 55, 80, 116, 166, 240, 345, 497, 710, 1016, 1453, 2073, 2955, 4211, 5992, 8523, 12111, 17202, 24423, 34648, 49152, 69694, 98795, 140009, 198378, 281016, 398002, 563612, 797999, 1129737, 1599166, 2263457, 3203381
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,3
|
|
LINKS
|
Daniel Suteu, Table of n, a(n) for n = 0..90
|
|
FORMULA
|
Number of terms x from A001694 for which x <= 2^n.
a(n) = Sum_{k=0..n} A062761(k). - Daniel Suteu, Feb 18 2020
|
|
EXAMPLE
|
Below 128, the 18 powerful numbers {1,4,8,9,16,25,...,100,108,121,125,128} can be found, so a(7)=18.
|
|
PROG
|
(PARI) a(n) = my(s=0, N=2^n); forsquarefree(k=1, sqrtnint(N, 3), s += sqrtint(N\k[1]^3)); s; \\ Daniel Suteu, Feb 18 2020
|
|
CROSSREFS
|
Cf. A001694, A029837, A036380, A036386, A062761.
Sequence in context: A135908 A056891 A065462 * A004693 A272136 A254308
Adjacent sequences: A062759 A062760 A062761 * A062763 A062764 A062765
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Labos Elemer, Jul 16 2001
|
|
EXTENSIONS
|
a(19)-a(41) from Donovan Johnson, Oct 01 2009
|
|
STATUS
|
approved
|
|
|
|