login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A000853 Number of n-input 2-output switching networks under action of complementing group C(2,n) on inputs and S(2) and C(2,2) on outputs.
(Formerly M3054 N1238)
1
3, 18, 1200, 33601536, 72057597192044544, 664613997892457950142846397346480128, 113078212145816597093331040047546785266841516594958545044409945396273479680 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

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..10

Index entries for sequences related to switching networks

FORMULA

a(n) = (4^(2^n)+6*(2^n-1)*4^(2^(n-1))+2^(2^n+1))/2^(n+3). - Sean A. Irvine, Aug 11 2011

MAPLE

A000853:=n->(4^(2^n)+6*(2^n-1)*4^(2^(n-1))+2^(2^n+1))/2^(n+3): seq(A000853(n), n=1..8); # Wesley Ivan Hurt, May 03 2017

PROG

(MAGMA) [(4^(2^n)+6*(2^n-1)*4^(2^(n-1))+2^(2^n+1))/2^(n+3): n in [1..12]]; // Vincenzo Librandi, Aug 11 2011

CROSSREFS

Sequence in context: A064846 A157544 A202946 * A065402 A131489 A069854

Adjacent sequences:  A000850 A000851 A000852 * A000854 A000855 A000856

KEYWORD

nonn,easy

AUTHOR

N. J. A. Sloane

EXTENSIONS

More terms from Sean A. Irvine, Aug 10 2011

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 28 00:54 EDT 2021. Contains 346316 sequences. (Running on oeis4.)