login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A183891 Number of arrangements of n+3 numbers in 0..8 with each number being the sum mod 9 of three others 1

%I

%S 1,241,81751,2466535,34099017,356237575,3382161175,31040377215,

%T 281338882705,2538405887395,22865861038983,205856624277475,

%U 1852911128126185,16676836226840751,150093537945401959

%N Number of arrangements of n+3 numbers in 0..8 with each number being the sum mod 9 of three others

%C Column 8 of A183892

%H R. H. Hardin, <a href="/A183891/b183891.txt">Table of n, a(n) for n = 1..22</a>

%e Some solutions for n=2

%e ..0....3....3....0....8....6....0....3....1....6....3....6....6....3....6....0

%e ..3....6....3....3....6....8....6....6....3....0....6....3....2....1....6....3

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

%e ..6....6....0....6....6....6....3....6....3....3....0....3....6....7....0....6

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

%K nonn

%O 1,2

%A _R. H. Hardin_ Jan 07 2011

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 February 26 02:17 EST 2021. Contains 341619 sequences. (Running on oeis4.)