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

 

Logo

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A183903 Number of nondecreasing arrangements of n+3 numbers in 0..8 with each number being the sum mod 9 of three others 0
1, 9, 242, 1866, 6503, 15973, 33236, 62678, 110487, 185231, 298538, 465912, 707702, 1050242, 1527181, 2181023, 3064898, 4244586, 5800817, 7831871, 10456503 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

Column 8 of A183904

LINKS

Table of n, a(n) for n=1..21.

FORMULA

Empirical: a(n) = (1/40320)*n^8 + (1/672)*n^7 + (37/960)*n^6 + (9/16)*n^5 + (9709/1920)*n^4 + (917/32)*n^3 + (14159/10080)*n^2 - (119065/168)*n + 801 for n>5

EXAMPLE

All solutions for n=2

..0....0....0....0....0....0....0....1....2

..0....0....3....0....0....3....0....3....5

..3....3....6....3....6....3....0....3....6

..6....3....6....3....6....3....0....4....6

..6....3....6....6....6....6....0....7....8

CROSSREFS

Sequence in context: A278858 A274789 A263158 * A251670 A075127 A267416

Adjacent sequences:  A183900 A183901 A183902 * A183904 A183905 A183906

KEYWORD

nonn

AUTHOR

R. H. Hardin Jan 07 2011

STATUS

approved

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 January 19 20:41 EST 2020. Contains 331066 sequences. (Running on oeis4.)