The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A371185 Indices of the cubefull numbers in the sequence of powerful numbers. 2
1, 3, 5, 7, 8, 11, 13, 17, 18, 23, 25, 26, 30, 34, 38, 41, 42, 45, 49, 54, 55, 61, 63, 72, 77, 78, 80, 82, 83, 87, 89, 93, 99, 105, 106, 113, 115, 116, 127, 128, 130, 137, 140, 148, 151, 153, 161, 164, 166, 179, 185, 186, 188, 192, 196, 201, 206, 221, 227, 234 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
FORMULA
A001694(a(n)) = A036966(n).
a(n) ~ c * n^(3/2), where c = A090699 / A362974^(3/2) = 0.216089803749...
EXAMPLE
The first 5 powerful numbers are 1, 4, 8, 9, and 16. The 1st, 3rd, and 5th, 1, 8, and 16, are also cubefull numbers. Therefore, the first 3 terms of this sequence are 1, 3, and 5.
MATHEMATICA
powQ[n_, emin_] := n == 1 || AllTrue[FactorInteger[n], Last[#] >= emin &]; Position[Select[Range[20000], powQ[#, 2] &], _?(powQ[#1, 3] &), Heads -> False] // Flatten
PROG
(PARI) ispow(n, emin) = n == 1 || vecmin(factor(n)[, 2]) >= emin;
lista(kmax) = {my(f, c = 0); for(k = 1, kmax, if(ispow(k, 2), c++; if(ispow(k, 3), print1(c, ", ")))); }
CROSSREFS
Similar sequences: A361936, A371186.
Sequence in context: A047485 A024969 A296233 * A276112 A228075 A309405
KEYWORD
nonn,easy
AUTHOR
Amiram Eldar, Mar 14 2024
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 2 03:32 EDT 2024. Contains 373032 sequences. (Running on oeis4.)