|
|
A020654
|
|
Lexicographically earliest infinite increasing sequence of nonnegative numbers containing no 5-term arithmetic progression.
|
|
49
|
|
|
0, 1, 2, 3, 5, 6, 7, 8, 10, 11, 12, 13, 15, 16, 17, 18, 25, 26, 27, 28, 30, 31, 32, 33, 35, 36, 37, 38, 40, 41, 42, 43, 50, 51, 52, 53, 55, 56, 57, 58, 60, 61, 62, 63, 65, 66, 67, 68, 75, 76, 77, 78, 80, 81, 82, 83, 85, 86, 87, 88, 90, 91, 92, 93, 125, 126, 127
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,3
|
|
COMMENTS
|
This is also the set of numbers with no "4" in their base-5 representation. In fact, for any prime p, the sequence consisting of numbers with no (p-1) in their base-p expansion is the same as the earliest sequence containing no p-term arithmetic progression. - Nathaniel Johnston, Jun 26-27 2011
|
|
LINKS
|
|
|
MAPLE
|
seq(`if`(numboccur(4, convert(n, base, 5))=0, n, NULL), n=0..127); # Nathaniel Johnston, Jun 27 2011
|
|
MATHEMATICA
|
Select[ Range[ 0, 100 ], (Count[ IntegerDigits[ #, 5 ], 4 ]==0)& ]
|
|
PROG
|
(Python)
from sympy.ntheory.factor_ import digits
print([n for n in range(201) if digits(n, 5)[1:].count(4)==0]) # Indranil Ghosh, May 23 2017
(Julia)
function a(n)
m, r, b = n, 0, 1
while m > 0
m, q = divrem(m, 4)
r += b * q
b *= 5
end
r end; [a(n) for n in 0:66] |> println # Peter Luschny, Jan 03 2021
|
|
CROSSREFS
|
Summary of increasing sequences avoiding arithmetic progressions of specified lengths (the second of each pair is obtained by adding 1 to the first):
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|