_Reinhard Zumkeller_, , <a href="/A090424/b090424.txt">Table of n, a(n) for n = 1..100</a>

_Reinhard Zumkeller, _, <a href="/A090424/b090424.txt">Table of n, a(n) for n = 1..100</a>

editing

approved

(Haskell)

import Data.List (elemIndex)

import Data.Maybe (fromJust)

a090424 = (+ 1) . fromJust . (`elemIndex` a090418_list)

-- Reinhard Zumkeller, Aug 07 2012

Based on corrections of A090418, data recomputed by Reinhard Zumkeller, Aug 07 2012

2, 11, 23, 47, 367, 175, 95, 189, 509, 375, 191, 381, 763, 1015, 751, 959, 1021, 383, 765, 1023, 3067, 1407, 2045, 767, 4087, 11247, 3063, 8123, 1919, 5999, 1533, 5623, 4063, 3067, 3007, 3039, 1535, 6013, 5631, 6077, 8183, 4093, 7935, 11247, 3069, 12023, 12143, 6139, 6015, 6111, 1535, 15869, 11775, 81276127, 3071, 6079, 6135, 7679, 32507

Reinhard Zumkeller, <a href="/A090424/b090424.txt">Table of n, a(n) for n = 1..100</a>

approved

editing

_Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), _, Nov 30 2003

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.

nonn,base,new

nonn,base,new

Reinhard Zumkeller (reinhard.zumkeller(AT)lhsystemsgmail.com), Nov 30 2003

Smallest number that can be written in binary representation as concatenation of other primes in exactly n ways.

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

1,1

A090418(a(n)) = n and A090418(m) <> n for m < a(n).

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.

Cf. A004676, A007088.

nonn,base

Reinhard Zumkeller (reinhard.zumkeller(AT)lhsystems.com), Nov 30 2003

approved