OFFSET
1,1
COMMENTS
Numbers m such that Sum_{k >= 0} floor(m/2^k) is a prime. - Clark Kimberling, Feb 13 2025
MAPLE
isA011371 := proc(n) option remember; local k, a; for k from 0 do a := A011371(k) ; if a > n then return false; elif a = n then return true; end if; end do: end proc:
A181516 := proc(n) option remember; local a; if n = 1 then 3; else for a from procname(n-1)+1 do if isprime(a) then if isA011371(a) then return a; end if; end if; end do; end if; end proc:
A181518 := proc(n) for m from 1 do if A011371(m) = A181516(n) then return m/2 ; end if; end do: end proc: # R. J. Mathar, Nov 04 2010
MATHEMATICA
f[n_] := Sum[Floor[n/2^k], {k, 0, Floor[Log[2, n]]}] (* A005187 *)
Select[Range[400], PrimeQ[f[#]] &] (* Clark Kimberling, Feb 13 2025 *)
CROSSREFS
KEYWORD
nonn
AUTHOR
Vladimir Shevelev, Oct 26 2010
EXTENSIONS
Corrected (88 inserted, 129 replaced by 179) and extended beyond 227 by R. J. Mathar, Nov 04 2010
STATUS
approved
