login
The OEIS is supported by the many generous donors 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; text; internal format)
OFFSET
1,1
COMMENTS
The next term a(7) is too large to be displayed here.
REFERENCES
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..9 (shortened by N. J. A. Sloane, Jan 13 2019)
M. A. Harrison, On the number of classes of switching networks, J. Franklin Instit., 276 (1963), 313-327.
FORMULA
a(n) = (2^(3*2^n)+(2^n-1)*2^(3*2^(n-1)))/2^n. - Sean A. Irvine, Jul 04 2011
MATHEMATICA
a[n_]:=(2^(3*2^n)+(2^n-1)*2^(3*2^(n-1)))/2^n; Table[a[n], {n, 6}] (* James C. McMahon, Dec 07 2023 *)
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: A223358 A184292 A225830 * A151584 A233085 A215858
KEYWORD
nonn
AUTHOR
EXTENSIONS
More terms from Sean A. Irvine, Jul 03 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 12:33 EDT 2024. Contains 371969 sequences. (Running on oeis4.)