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!)
A359083 Numbers k such that A246600(k) = A000005(k) and A000005(k) sets a new record. 6
1, 3, 15, 63, 255, 891, 4095, 262143, 1048575, 16777215, 68719476735 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
Numbers k with a record number of divisors, such that for all the divisors d of k the bitwise OR of k and d is equal to k (or equivalently, the bitwise AND of k and d is equal to d).
All the terms are odd since all the terms of A359080 are odd.
The corresponding numbers of divisors are 1, 2, 4, 6, 8, 10, 24, 32, 48, 96, 512, ... .
a(12) > 3*10^11, if it exists.
LINKS
MATHEMATICA
s[n_] := DivisorSum[n, 1 &, BitAnd[n, #] == # &]; seq={}; dm = 0; Do[d = DivisorSigma[0, n]; If[d > dm && d == s[n], dm = d; AppendTo[seq, n]], {n, 1, 2*10^7}]; seq
PROG
(PARI) lista(nmax) = {my(list = List(), ndmax = 0, d, s); for(n = 1, nmax, nd = numdiv(n); if(nd > ndmax && sumdiv(n, d, bitand(d, n)==d) == nd, ndmax = nd; listput(list, n))); Vec(list)};
CROSSREFS
Subsequence of A359080.
Sequence in context: A216757 A218366 A359082 * A218236 A218282 A103454
KEYWORD
nonn,base,more
AUTHOR
Amiram Eldar, Dec 15 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:34 EDT 2024. Contains 372203 sequences. (Running on oeis4.)