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

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A250228 Number of length n+1 0..7 arrays with the sum of the cubes of adjacent differences multiplied by some arrangement of +-1 equal to zero. 0

%I #5 Apr 21 2021 15:50:22

%S 8,88,248,2392,10640,120412,838604,8983896,78435176,789142896,

%T 7558414812,74218486628

%N Number of length n+1 0..7 arrays with the sum of the cubes of adjacent differences multiplied by some arrangement of +-1 equal to zero.

%C Column 7 of A250229.

%e Some solutions for n=6

%e ..2....7....2....1....6....3....7....6....0....0....2....4....4....6....1....6

%e ..1....0....5....4....2....1....4....5....2....1....3....5....3....4....1....5

%e ..2....7....5....3....4....4....3....6....5....2....0....6....0....5....4....6

%e ..5....6....0....5....7....7....7....2....5....6....3....6....1....0....1....4

%e ..2....7....5....3....5....4....4....1....5....1....1....6....4....5....6....0

%e ..1....4....2....6....1....2....2....5....3....5....2....0....6....7....1....3

%e ..2....7....2....5....4....5....7....4....6....6....6....6....4....6....1....6

%Y Cf. A250229.

%K nonn

%O 1,1

%A _R. H. Hardin_, Nov 14 2014

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.

Last modified December 2 20:53 EST 2023. Contains 367526 sequences. (Running on oeis4.)