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!)
A183883 Number of arrangements of n+2 numbers in 0..8 with each number being the sum mod 9 of two others 2

%I #5 Mar 31 2012 12:35:55

%S 1,31,1761,75451,1598395,23327655,275846173,2895194179,28388585391,

%T 267809160367,2472279047473,22552186971627,204400652073763,

%U 1846262280059767,16646854130219781,149959684159252819

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

%C Column 8 of A183884

%H R. H. Hardin, <a href="/A183883/b183883.txt">Table of n, a(n) for n = 1..53</a>

%e Some solutions for n=2

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

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

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

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

%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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 28 04:13 EDT 2024. Contains 371235 sequences. (Running on oeis4.)