OFFSET
1,1
COMMENTS
The next term a(8) 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..12
M. A. Harrison, On the number of classes of switching networks, J. Franklin Instit., 276 (1963), 313-327.
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
MATHEMATICA
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 *)
PROG
(Magma) [(2^(2^(n+1))+(2^n-1)*2^(2^n))/2^n: n in [1..8]]; // Vincenzo Librandi, Jul 04 2011
CROSSREFS
KEYWORD
nonn
AUTHOR
EXTENSIONS
More terms from Sean A. Irvine, Jul 03 2011
STATUS
approved