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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A261742 Number of partitions of n where each part i is marked with a word of length i over an octonary alphabet whose letters appear in alphabetical order. 2

%I #13 May 10 2021 06:24:36

%S 1,8,100,920,8986,77000,690652,5752280,48916087,401709720,3324377084,

%T 26996501992,220265771738,1777445952616,14377907329724,

%U 115613187110872,930725344479074,7467529999843432,59954521406306500,480433200037686456,3851244156978563566

%N Number of partitions of n where each part i is marked with a word of length i over an octonary alphabet whose letters appear in alphabetical order.

%H Alois P. Heinz, <a href="/A261742/b261742.txt">Table of n, a(n) for n = 0..1000</a>

%F a(n) ~ c * 8^n, where c = Product_{k>=2} 1/(1 - binomial(k+7,7)/8^k) = 3.3565128773700137140303140039343582841894554205106317247... - _Vaclav Kotesovec_, Oct 11 2017, updated May 10 2021

%F G.f.: Product_{k>=1} 1 / (1 - binomial(k+7,7)*x^k). - _Ilya Gutkovskiy_, May 10 2021

%p b:= proc(n, i) option remember; `if`(n=0, 1, `if`(i<1, 0,

%p b(n, i-1)+`if`(i>n, 0, b(n-i, i)*binomial(i+7, 7))))

%p end:

%p a:= n-> b(n\$2):

%p seq(a(n), n=0..30);

%Y Column k=8 of A261718.

%K nonn

%O 0,2

%A _Alois P. Heinz_, Aug 30 2015

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 August 13 10:15 EDT 2024. Contains 375130 sequences. (Running on oeis4.)