A000808 - OEIS

This site is supported by donations to The OEIS Foundation.

A000808

Number of switching networks (see Harrison reference for precise definition).
(Formerly M4726 N2020)

10, 76, 8416, 268496896, 576460756464173056, 5316911983139663509773741938679218176, 904625697166532776746648320380374280441295666129685538275829368373028847616 (list; graph; refs; listen; history; internal format)

	OFFSET	`1,1`
	COMMENTS	`The next term a(8) is too large to be displayed here.`
	REFERENCES	`M. A. Harrison, On the number of classes of switching networks, J. Franklin Instit., 276 (1963), 313-327.` `N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).` `N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).`
	LINKS	`Vincenzo Librandi, Table of n, a(n) for n = 1..12` `Index entries for sequences related to switching networks` `INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 49` `INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 51`
	FORMULA	`a(n) = (2^(2^(n+1))+(2^n-1)*2^(2^n))/2^n. [Sean A. Irvine, Jul 04 2011]`
	PROG	`(MAGMA) [(2^(2^(n+1))+(2^n-1)*2^(2^n))/2^n: n in [1..8]]; // Vincenzo Librandi, Jul 04 2011`
	CROSSREFS	`Sequence in context: A075489 A184273 A185986 * A159579 A081678 A081182` `Adjacent sequences: A000805 A000806 A000807 * A000809 A000810 A000811`
	KEYWORD	`nonn`
	AUTHOR	`N. J. A. Sloane (njas(AT)research.att.com).`
	EXTENSIONS	`More terms from Sean A. Irvine (sairvin(AT)xtra.co.nz), Jul 03 2011`

Content is available under The OEIS End-User License Agreement .

Last modified February 16 20:12 EST 2012. Contains 205962 sequences.