|
%I M5020 #40 Apr 13 2022 13:25:17
%S 16,240,6448,187184,5474096,160196400,4688357168,137211717424,
%T 4015706384176,117525666899760,3439564830058288,100664021209884464,
%U 2946083492311639856,86221550057181718320,2523402922444883797808,73851169513661744064304
%N Number of Boolean functions realized by n-input cascades.
%D N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H J. T. Butler, <a href="http://faculty.nps.edu/butler/PDF/1978/But_IEEETC1978.pdf">Tandem networks of universal cells</a>, IEEE Trans. Computers, C-27 (1978), 785-799. (<a href="/A005618/a005618.pdf">Annotated scanned copy</a>)
%H Simon Plouffe, <a href="https://arxiv.org/abs/0911.4975">Approximations de séries génératrices et quelques conjectures</a>, Dissertation, Université du Québec à Montréal, 1992; arXiv:0911.4975 [math.NT], 2009.
%H Simon Plouffe, <a href="/A000051/a000051_2.pdf">1031 Generating Functions</a>, Appendix to Thesis, Montreal, 1992
%H <a href="/index/Bo#Boolean">Index entries for sequences related to Boolean functions</a>
%F a(n) = C1 * alpha1^(n+1) + C2 * alpha2^(n+1) + 48/49 where C1 = (-1202 + 363*s) / (1960*s), C2 = (1202 + 363*s) / (1960*s), alpha1 = 16 + 4*s, alpha2 = 16 - 4*s, s=sqrt(11) [From Butler]. - _Sean A. Irvine_, Jul 20 2016
%p A005619:= -16*z^2*(1-18*z+20*z^2)/((z-1)*(80*z^2-32*z+1)); # conjectured by _Simon Plouffe_ in his 1992 dissertation
%K nonn
%O 2,1
%A _N. J. A. Sloane_
%E More terms from _Sean A. Irvine_, Jul 20 2016
|
