

A294357


Smallest odd number that can be expressed in more ways by sums of 3 odd primes p+q+r with p <= q <= r than any smaller odd number.


4



9, 13, 17, 21, 25, 27, 29, 33, 37, 39, 45, 47, 51, 53, 63, 65, 71, 77, 83, 89, 95, 101, 107, 113, 119, 125, 131, 137, 143, 149, 161, 167, 173, 185, 191, 197, 203, 209, 215, 221, 227, 233, 239, 245, 247, 251, 257, 269, 277, 281, 287, 293, 299
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,1


COMMENTS

Position of nth record in A007963 converted to actual odd number for which the record is achieved.
The corresponding records of numbers of representations are provided in A294358.
Empirically mod(a(n),6) = 5 for all a(n) > 63 and mod(a(n),30) != 5 for all a(n) > 425.


LINKS

Hugo Pfoertner, Table of n, a(n) for n = 1..1113


FORMULA

a(1)=9 because 9 = 3+3+3 is the smallest number that can be represented as sum of 3 odd primes.
a(13)=51 because A007963(25) = A007963((511)/2) = 14 is the 13th record in A007963.


CROSSREFS

Cf. A007963, A102605, A139321, A294294, A294295, A294358.
Sequence in context: A106636 A186427 A050109 * A329388 A227062 A134441
Adjacent sequences: A294354 A294355 A294356 * A294358 A294359 A294360


KEYWORD

nonn


AUTHOR

Hugo Pfoertner, Oct 29 2017


STATUS

approved



