login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A275489 Most consecutive numbers that can be covered with arithmetic progressions of differences 2i+1, 1<=i<=n. 1
1, 2, 4, 6, 10, 13, 17, 22, 30, 38, 45, 53, 63, 74, 83, 96, 112, 128, 145 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
Erdos and Selfridge conjecture that there is no covering system whose moduli are distinct odd integers > 1. This is equivalent to saying that a(n) is finite for all n.
LINKS
Wikipedia, Covering system.
EXAMPLE
[1,2,3,4] can be covered by the arithmetic progressions 3k+1, 5k+2 and 7k+3 but [1,2,3,4,5] can't be covered by three arithmetic progressions with differences 3, 5 and 7, so a(3) = 4.
CROSSREFS
Sequence in context: A087148 A297531 A334821 * A153817 A354673 A309616
KEYWORD
nonn,more
AUTHOR
Robert Israel, Jul 29 2016
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 03:15 EDT 2024. Contains 371964 sequences. (Running on oeis4.)