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!)
A357285 a(n) = number of subsets S of {1,2,...,n} having more than 2 elements such that (sum of least three elements of S) < max(S). 2
0, 0, 0, 0, 0, 0, 0, 8, 32, 104, 304, 792, 1920, 4520, 10192, 22392, 48416, 102856, 215664, 448792, 925632, 1897064, 3872016, 7868344, 15936096, 32208136, 64946096, 130738776, 262886656, 527990696, 1059498576, 2124829944, 4258791328, 8532044360, 17087943920 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,8
LINKS
Index entries for linear recurrences with constant coefficients, signature (4, -3, -2, -6, 8, 24, -40, 16).
FORMULA
a(n) = 4*a(n-1) - 3*a(n-2) - 2*a(n-3) - 6*a(n-4) + 8*a(n-5) + 24*a(n-6) - 40*a(n-7).
G.f.: -((8 x^7)/((-1 + x)^2 (-1 + 2 x) (-1 + 2 x^2) (-1 + 4 x^3))).
EXAMPLE
The 8 relevant subsets of {1,2,3,4,5,6,7} are {1,2,3,7}, {1,2,3,4,7}, {1,2,3,5,7}, {1,2,3,6,7}, {1,2,3,4,5,7}, {1,2,3,4,6,7}, {1,2,3,5,6,7}, and {1,2,3,4,5,6,7}.
MATHEMATICA
s[n_] := s[n] = Select[Subsets[Range[n]], Length[#] >= 3 &];
a[n_] := Select[s[n], #[[1]] + #[[2]] + #[[3]] < #[[-1]] &]
Table[Length[a[n]], {n, 0, 18}]
CROSSREFS
Sequence in context: A195590 A071345 A178797 * A100312 A302507 A204643
KEYWORD
nonn,easy
AUTHOR
Clark Kimberling, Oct 02 2022
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 May 1 05:44 EDT 2024. Contains 372148 sequences. (Running on oeis4.)