|
|
A264647
|
|
Smallest number m such that A263856(m) = n.
|
|
2
|
|
|
1, 2, 6, 4, 10, 8, 79, 199, 9, 108, 11, 29, 17, 15, 40, 80, 20, 59, 306, 22, 169, 38, 27, 82, 287, 41, 49, 209, 47, 135, 31, 36, 127, 112, 123, 162, 46, 89, 63, 54, 581, 43, 56, 770, 67, 48, 134, 52, 142, 69, 58, 101, 382, 466, 75, 64, 273, 95, 117, 126, 72
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
a(6949) > 22700000 if it exists. - Chai Wah Wu, Feb 01 2016
|
|
LINKS
|
|
|
FORMULA
|
|
|
MATHEMATICA
|
f[p_] := f[p] = StringJoin @@ ToString /@ Reverse[IntegerDigits[p, 2]];
S[n_] := S[n] = SortBy[Prime[Range[n]], f];
a[n_] := a[n] = For[m = 1, True, m++, If[A263856[m] == n, Return[m]]];
|
|
PROG
|
(Haskell)
import Data.List (elemIndex); import Data.Maybe (fromJust)
a264647 = (+ 1) . fromJust . (`elemIndex` a263856_list)
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|