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!)
A245918 Number of pairs of endofunctions f, g on [n] satisfying f(g^9(i)) = f(i) for all i in [n]. 2

%I #4 Aug 06 2014 15:42:43

%S 1,1,10,207,6856,302345,17812656,1384059775,131612023936,

%T 30607186160529,9712391319942400,2685817593368889551,

%U 809491207939940828160,280106645752842329055193,99175751774345673351479296,36958774352800067430488661375,15213494922728791702295969038336

%N Number of pairs of endofunctions f, g on [n] satisfying f(g^9(i)) = f(i) for all i in [n].

%H Alois P. Heinz, <a href="/A245918/b245918.txt">Table of n, a(n) for n = 0..150</a>

%p with(combinat):

%p b:= proc(n, i) option remember; unapply(`if`(n=0 or i=1, x^n,

%p expand(add((i-1)!^j*multinomial(n, n-i*j, i$j)/j!*

%p x^(igcd(i, 9)*j)*b(n-i*j, i-1)(x), j=0..n/i))), x)

%p end:

%p a:= n-> add(binomial(n-1, j-1)*n^(n-j)*b(j$2)(n), j=0..n):

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

%Y Column k=9 of A245910.

%K nonn

%O 0,3

%A _Alois P. Heinz_, Aug 06 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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 28 09:32 EDT 2024. Contains 375477 sequences. (Running on oeis4.)