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!)
A102553 Numbers k such that for all prime-factors p: p = (k AND p), bitwise. 6
1, 2, 3, 5, 7, 11, 13, 15, 17, 19, 23, 27, 29, 31, 37, 41, 43, 47, 51, 53, 59, 61, 63, 67, 71, 73, 79, 83, 85, 89, 95, 97, 101, 103, 107, 109, 111, 113, 119, 123, 125, 127, 131, 135, 137, 139, 143, 149, 151, 157, 163, 167, 173, 175, 179, 181, 187, 191, 193, 197, 199 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
Numbers k such that A102550(k) = A001221(k).
Apart from first term, subsequence of A102552;
A000040 is a subsequence.
Numbers k such that the bitwise OR of k with all prime divisors of k is equal to k. - Chai Wah Wu, Dec 18 2022
LINKS
MATHEMATICA
okQ[n_] := AllTrue[FactorInteger[n][[All, 1]], # == BitAnd[n, #]&];
Select[Range[200], okQ] (* Jean-François Alcover, Nov 16 2021 *)
PROG
(Python)
from itertools import count, islice
from operator import ior
from functools import reduce
from sympy import primefactors
def A102553_gen(startvalue=1): # generator of terms >= startvalue
return filter(lambda n:n == 1 or n|reduce(ior, primefactors(n))==n, count(max(startvalue, 1)))
A102553_list = list(islice(A102553_gen(), 20)) # Chai Wah Wu, Dec 18 2022
CROSSREFS
Sequence in context: A331635 A320055 A072697 * A069161 A328603 A304713
KEYWORD
nonn,base
AUTHOR
Reinhard Zumkeller, Jan 14 2005
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 August 3 02:56 EDT 2024. Contains 374875 sequences. (Running on oeis4.)