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!)
A068567 Numbers k such that gpf(k) < k/gpf(k) and gpf(k/gpf(k)) < gpf(k), where gpf(n) is the greatest prime factor of n, A006530. 1
12, 24, 30, 40, 45, 48, 56, 60, 63, 70, 80, 84, 90, 96, 105, 112, 120, 126, 132, 135, 140, 154, 160, 165, 168, 175, 176, 180, 182, 189, 192, 195, 198, 208, 210, 220, 224, 231, 234, 240, 252, 260, 264, 270, 273, 275, 280, 286 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
PROG
(PARI) gpf(j)={if(j==1, 1, my(f=factor(j)); f[#f[, 2], 1])};
for(k=1, 300, my(L=gpf(k)); if(L<k/L, if(gpf(k/L)<L, print1(k, ", ")))) \\ Hugo Pfoertner, Apr 11 2020
CROSSREFS
Cf. A063539.
Sequence in context: A369182 A108938 A085236 * A316099 A082801 A328587
KEYWORD
nonn
AUTHOR
Reinhard Zumkeller, Mar 25 2002
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 April 24 15:37 EDT 2024. Contains 371960 sequences. (Running on oeis4.)