login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A000809 Number of switching networks (see Harrison reference for precise definition).
(Formerly M5258 N2290)
1
36, 1072, 2100736, 17592201773056, 2475880078571033228681936896, 98079714615416886934934209815610010226578261138395365376 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

COMMENTS

The next term a(7) 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

FORMULA

a(n) = (2^(3*2^n)+(2^n-1)*2^(3*2^(n-1)))/2^n. [Sean A. Irvine, Jul 4 2011.]

PROG

(MAGMA) [(2^(3*2^n)+(2^n-1)*2^(3*2^(n-1)))/2^n: n in [1..8]]; // Vincenzo Librandi, Jul 04 2011

CROSSREFS

Sequence in context: A025419 A180802 A184292 * A151584 A103278 A004294

Adjacent sequences:  A000806 A000807 A000808 * A000810 A000811 A000812

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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

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

Last modified February 17 16:00 EST 2012. Contains 206050 sequences.