OFFSET
2,1
COMMENTS
Known positions of records occur at n = {2, 3, 4, 6, 8, 10, 12, 16, 18, 20, 24, 30, 36, 40, 42, 48}.
Conjecture: For n that is not prime, a(n) > a(PrimePi(n)), where PrimePi() is the prime counting function.
EXAMPLE
a(2) = 2, with one answer being the trivial zeros, and the other:
1 1 1 1 1 1 3 3 3 11_2 11_2 11_2
1 1 1 . 1 1 1 = 3 3 3 = 11_2 11_2 11_2
1 1 1 1 1 1 3 3 3 11_2 11_2 11_2
a(3), one of the true cases is:
0 1 2 2 1 0 2 4 6 2_3 11_3 20_3
2 2 2 . 1 1 1 = 6 8 8 = 20_3 22_3 22_3
1 2 2 1 1 1 4 7 8 11_3 21_3 22_3
a(10):
4 9 4 9 2 1 49 92 41
4 3 2 . 1 8 1 = 41 38 21
5 5 1 1 3 7 51 53 17
CROSSREFS
KEYWORD
nonn,base
AUTHOR
Robert P. P. McKone, Aug 01 2024
STATUS
approved