|
|
A190646
|
|
Least number k such that d(k-1) = d(k+1) = 2n or 0 if no such k exists, where d(n)=A000005(n).
|
|
5
|
|
|
4, 7, 19, 41, 127252, 199, 26890624, 919, 17299, 6641, 25269208984376, 3401, 3900566650390624, 640063, 8418574, 18089, 1164385682220458984374, 41651, 69528379848480224609374, 128465, 34084859374, 12164095, 150509919493198394775390626, 90271
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
a(28) = 2319679. a(30) = 3568049.
a(26) = 64505245697, a(27) = 3959299, a(29) = 237828698392557762563228607177734374, a(31) = 26711406049549496732652187347412109374, a(32) = 441559, a(34) = 12535291248641, a(36) = 352351, a(37) = 1749348542212388688829378224909305572509765626, a(38) = 193405731995647.
Conjecture: if p is an odd prime, then a(p) is even.
(End)
|
|
LINKS
|
|
|
EXAMPLE
|
a(16)=18089 because d(18088)=d(18090)=2*16.
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
a(7), a(11), a(13), and a(15) from T. D. Noe, May 25 2011
a(17), a(19), a(21)-a(23) from Chai Wah Wu, Mar 13 2019
|
|
STATUS
|
approved
|
|
|
|