|
|
A258601
|
|
Smallest number m such that A036967(m) = prime(n)^4.
|
|
8
|
|
|
2, 5, 10, 16, 28, 37, 55, 61, 80, 105, 112, 140, 160, 165, 183, 209, 236, 244, 265, 283, 289, 316, 335, 360, 389, 408, 414, 430, 435, 452, 505, 520, 542, 549, 589, 598, 613, 637, 651, 675, 697, 701, 737, 743, 754, 765, 806, 844, 866, 870, 880, 899, 908, 940
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
A036967(m) mod prime(n) > 0 for m < a(n);
also smallest number m such that A258569(m) = prime(n):
|
|
LINKS
|
|
|
EXAMPLE
|
. ----+----+-------+---------------------------------
. 1 | 2 | 2 | 16
. 2 | 3 | 5 | 81
. 3 | 5 | 10 | 625
. 4 | 7 | 16 | 2401
. 5 | 11 | 28 | 14641
. 6 | 13 | 37 | 28561
. 7 | 17 | 55 | 83521
. 8 | 19 | 61 | 130321
. 9 | 23 | 80 | 279841
. 10 | 29 | 105 | 707281
. 11 | 31 | 112 | 923521
. 12 | 37 | 140 | 1874161
. 13 | 41 | 160 | 2825761
. 14 | 43 | 165 | 3418801
. 15 | 47 | 183 | 4879681
. 16 | 53 | 209 | 7890481
. 17 | 59 | 236 | 12117361
. 18 | 61 | 244 | 13845841
. 19 | 67 | 265 | 20151121
. 20 | 71 | 283 | 25411681
. 21 | 73 | 289 | 28398241
. 22 | 79 | 316 | 38950081
. 23 | 83 | 335 | 47458321
. 24 | 89 | 360 | 62742241
. 25 | 97 | 389 | 88529281
|
|
PROG
|
(Haskell)
import Data.List (elemIndex); import Data.Maybe (fromJust)
a258601 = (+ 1) . fromJust . (`elemIndex` a258569_list) . a000040
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|