%I M4726 N2020 #38 Dec 07 2023 14:52:53
%S 10,76,8416,268496896,576460756464173056,
%T 5316911983139663509773741938679218176,
%U 904625697166532776746648320380374280441295666129685538275829368373028847616
%N Number of switching networks (see Harrison reference for precise definition).
%C The next term a(8) is too large to be displayed here.
%D N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
%D N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H Vincenzo Librandi, <a href="/A000808/b000808.txt">Table of n, a(n) for n = 1..12</a>
%H M. A. Harrison, <a href="https://doi.org/10.1016/0016-0032(63)90456-3">On the number of classes of switching networks</a>, J. Franklin Instit., 276 (1963), 313-327.
%H INRIA Algorithms Project, <a href="http://ecs.inria.fr/services/structure?nbr=49">Encyclopedia of Combinatorial Structures 49</a>
%H INRIA Algorithms Project, <a href="http://ecs.inria.fr/services/structure?nbr=51">Encyclopedia of Combinatorial Structures 51</a>
%H <a href="/index/Sw#switching">Index entries for sequences related to switching networks</a>
%F a(n) = (2^(2^(n+1)) + (2^n-1)*2^(2^n))/2^n. - _Sean A. Irvine_, Jul 04 2011
%t a[n_]:=(2^(2^(n+1))+(2^n-1)*2^(2^n))/2^n;Table[a[n],{n,7}] (* _James C. McMahon_, Dec 07 2023 *)
%o (Magma) [(2^(2^(n+1))+(2^n-1)*2^(2^n))/2^n: n in [1..8]]; // _Vincenzo Librandi_, Jul 04 2011
%Y Cf. A000079, A001146.
%K nonn
%O 1,1
%A _N. J. A. Sloane_
%E More terms from _Sean A. Irvine_, Jul 03 2011