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!)
A316228 Numbers whose Fermi-Dirac prime factorization sums to a Fermi-Dirac prime. 2
2, 3, 4, 5, 6, 7, 9, 10, 11, 12, 13, 14, 16, 17, 18, 19, 20, 22, 23, 24, 25, 28, 29, 31, 34, 36, 37, 39, 40, 41, 43, 46, 47, 48, 49, 52, 53, 55, 56, 58, 59, 61, 63, 66, 67, 71, 73, 76, 79, 81, 82, 83, 88, 89, 90, 94, 97, 100, 101, 103, 104, 107, 108, 109, 112 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
A Fermi-Dirac prime (A050376) is a number of the form p^(2^k) where p is prime and k >= 0. Every positive integer has a unique factorization into distinct Fermi-Dirac primes.
LINKS
EXAMPLE
Sequence of multiarrows in the form "number: sum <= factors" begins:
2: 2 <= {2}
3: 3 <= {3}
4: 4 <= {4}
5: 5 <= {5}
6: 5 <= {2,3}
7: 7 <= {7}
9: 9 <= {9}
10: 7 <= {2,5}
11: 11 <= {11}
12: 7 <= {3,4}
13: 13 <= {13}
14: 9 <= {2,7}
16: 16 <= {16}
17: 17 <= {17}
18: 11 <= {2,9}
19: 19 <= {19}
20: 9 <= {4,5}
22: 13 <= {2,11}
23: 23 <= {23}
24: 9 <= {2,3,4}
MATHEMATICA
FDfactor[n_]:=If[n==1, {}, Sort[Join@@Cases[FactorInteger[n], {p_, k_}:>Power[p, Cases[Position[IntegerDigits[k, 2]//Reverse, 1], {m_}->2^(m-1)]]]]];
Select[Range[2, 200], Length[FDfactor[Total[FDfactor[#]]]]==1&]
CROSSREFS
Sequence in context: A020660 A047306 A332108 * A353935 A348782 A331119
KEYWORD
nonn
AUTHOR
Gus Wiseman, Jun 27 2018
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 23 12:44 EDT 2024. Contains 371913 sequences. (Running on oeis4.)