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!)
A352618 Squares that are 7-smooth. 1
1, 4, 9, 16, 25, 36, 49, 64, 81, 100, 144, 196, 225, 256, 324, 400, 441, 576, 625, 729, 784, 900, 1024, 1225, 1296, 1600, 1764, 2025, 2304, 2401, 2500, 2916, 3136, 3600, 3969, 4096, 4900, 5184, 5625, 6400, 6561, 7056, 8100, 9216, 9604, 10000, 11025, 11664, 12544, 14400 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
Also, distinct terms appearing in A352598, or terms of the form 4^i * 9^j * 25^k * 49^m for i, j, k, m >= 0.
LINKS
FORMULA
a(n) = A002473(n)^2. - Pontus von Brömssen, Mar 24 2022
Sum_{n>=1} 1/a(n) = 1225/768. - Amiram Eldar, Mar 24 2022
EXAMPLE
49 = 7*7, 81 = (3*3)*(3*3), and 100 = (2*5)*(2*5) are terms.
MATHEMATICA
Select[Range[120], Max[FactorInteger[#][[;; , 1]]] <= 7 &]^2 (* Amiram Eldar, Mar 24 2022 *)
With[{n = 15000}, Union@ Flatten@ Table[2^(2 a)*3^(2 b)*5^(2 c)*7^(2 d), {a, 0, Log[4, n]}, {b, 0, Log[9, n/(2^(2 a))]}, {c, 0, Log[25, n/(2^(2 a)*3^(2 b))]}, {d, 0, Log[49, n/(2^(2 a)*3^(2 b)*5^(2 c))]}]] (* Michael De Vlieger, Mar 26 2022 *)
PROG
(Python)
from itertools import count, islice
def agen():
for i in count(1):
k = i
for p in [2, 3, 5, 7]:
while k%p == 0:
k //= p
if k == 1:
yield i*i
print(list(islice(agen(), 50)))
CROSSREFS
Intersection of A000290 and A002473.
Cf. A352598.
Sequence in context: A325148 A325149 A326707 * A030476 A077355 A077487
KEYWORD
nonn
AUTHOR
Michael S. Branicky, Mar 24 2022
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 May 3 02:26 EDT 2024. Contains 372203 sequences. (Running on oeis4.)