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!)
A334894 Number of maximal subsets of [n] avoiding 3-term arithmetic progressions and containing n if n>0. 2
1, 1, 1, 2, 2, 1, 3, 6, 15, 4, 20, 7, 18, 6, 1, 3, 10, 29, 54, 123, 2, 16, 44, 170, 2, 31, 2, 10, 24, 70, 1, 10, 2, 2, 10, 26, 2, 2, 82, 221, 20, 1, 3, 10, 27, 58, 167, 408, 831, 2005, 4216, 14, 36, 106, 2, 6, 18, 30, 2, 2, 2, 8, 34, 2, 2, 4, 8, 12, 80, 211 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,4
LINKS
Eric Weisstein's World of Mathematics, Nonaveraging Sequence
Wikipedia, Iverson bracket
FORMULA
a(n) = A262347(n) - [n > 0 and A003002(n) = A003002(n-1)] * A262347(n-1).
a(n) = A334892(n,A003002(n)).
a(n) = A334187(n,A003002(n)) - [n > 0] * A334187(n-1,A003002(n)).
CROSSREFS
Last elements of rows of A334892.
Sequence in context: A056043 A187005 A158497 * A110564 A210791 A299500
KEYWORD
nonn
AUTHOR
Alois P. Heinz, May 14 2020
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 March 29 11:14 EDT 2024. Contains 371278 sequences. (Running on oeis4.)