login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A226066 Smallest k such that n numbers can be picked in {1,...,k} with no six terms in arithmetic progression. 1
1, 2, 3, 4, 5, 7, 8, 9, 10, 12, 13, 14, 15, 17, 18, 19, 20, 22, 23, 24, 25, 26, 29, 32, 33, 35, 36, 37, 39, 40, 41, 44, 45, 46, 48, 49, 50, 51, 54, 56, 58, 59, 61, 62 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

REFERENCES

Knuth, Donald E., Satisfiability,  Fascicle 6, volume 4 of The Art of Computer Programming. Addison-Wesley, 2015, pages 135 and 190, Problem 31.

LINKS

Table of n, a(n) for n=1..44.

Samuel S. Wagstaff, Jr., On k-free sequences of integers, Math. Comp., 26 (1972), 767-771.

CROSSREFS

This sequence is to A003005 as A065825 is to A003002.

Cf. A225745, A225859.

Sequence in context: A039161 A032797 A001967 * A005838 A184486 A047203

Adjacent sequences:  A226063 A226064 A226065 * A226067 A226068 A226069

KEYWORD

nonn,more

AUTHOR

Don Knuth, Aug 05 2013

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 25 07:12 EDT 2019. Contains 321468 sequences. (Running on oeis4.)