|
Search: id:A090424
|
|
|
| A090424 |
|
Smallest number that can be written in binary representation as concatenation of other primes in exactly n ways. |
|
+0
2
|
|
| 2, 11, 23, 47, 367, 95, 189, 509, 191, 381, 751, 959, 1021, 383, 765, 1023, 3067, 2045, 767, 4087, 11247, 3063, 1533, 6013, 5631, 8183, 4093, 6111, 1535, 15869, 11775, 8127
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
A090418(a(n)) = n and A090418(m) <> n for m < a(n).
|
|
EXAMPLE
|
n=6: a(6)=95 -> '1011111': '10"11111'==2"31, '10"11"111'==2"3"7, '10"111"11'==2"7"3, '101"11"11'==5"3"3, '1011"111'==11"7, and '10111"11'==23"3, therefore A090418(95)=6.
|
|
CROSSREFS
|
Cf. A004676, A007088.
Sequence in context: A031385 A126916 A056637 this_sequence A106974 A115374 A078699
Adjacent sequences: A090421 A090422 A090423 this_sequence A090425 A090426 A090427
|
|
KEYWORD
|
nonn,base
|
|
AUTHOR
|
Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Nov 30 2003
|
|
|
Search completed in 0.002 seconds
|
