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!)
A354525 Numbers k such that A354512(k) = A001221(k). 11
1, 2, 3, 5, 6, 7, 9, 11, 13, 14, 15, 17, 19, 21, 23, 25, 29, 31, 33, 35, 37, 41, 43, 45, 47, 49, 51, 53, 55, 59, 61, 62, 67, 69, 71, 73, 77, 79, 83, 85, 89, 91, 93, 95, 97, 101, 103, 107, 109, 113, 115, 119, 121, 127, 131, 133, 137, 139, 141, 143, 145, 149, 151, 155, 157 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
Numbers k such that for every prime factor p of k we have gpf(k+p) = p, gpf = A006530.
Numbers k such that for every prime factor p of k, k+p is p-smooth.
If k is an even term, then k+2 is a power of 2, so k is of the form 2*(2^m-1). Those m for which 2*(2^m-1) is a term are listed in A354531.
LINKS
Jianing Song, Table of n, a(n) for n = 1..8435 (all terms <= 50000)
EXAMPLE
15 is a term since the prime factors of 15 are 3,5, and we have gpf(15+3) = 3 and gpf(15+5) = 5.
PROG
(PARI) gpf(n) = vecmax(factor(n)[, 1]);
isA354525(n) = my(f=factor(n)[, 1]); for(i=1, #f, if(gpf(n+f[i])!=f[i], return(0))); 1
CROSSREFS
Indices of 0 in A354527. Complement of A354526.
Sequence in context: A218442 A255057 A349150 * A340610 A358229 A106843
KEYWORD
nonn,easy
AUTHOR
Jianing Song, Aug 16 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 April 24 20:08 EDT 2024. Contains 371963 sequences. (Running on oeis4.)