cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A036442 a(n) = 2^((n-1)*(n+2)/2).

Original entry on oeis.org

1, 4, 32, 512, 16384, 1048576, 134217728, 34359738368, 17592186044416, 18014398509481984, 36893488147419103232, 151115727451828646838272, 1237940039285380274899124224, 20282409603651670423947251286016, 664613997892457936451903530140172288
Offset: 1

Views

Author

Abdallah Rayhan (rayhan(AT)engr.uvic.ca)

Keywords

Comments

Number of redundant paths for a fault-tolerant ATM switch.
Hankel transform (see A001906 for definition ) of A001850, A006139, A084601; also Hankel transform of the sequence 1, 0, 4, 0, 24, 0, 160, 0, 1120, ... (A059304 with interpolated zeros). - Philippe Deléham, Jul 03 2005
Hankel transform of A109980. Unsigned version of A127945. - Philippe Deléham, Dec 11 2008
a(n) = the multiplicative Wiener index of the wheel graph with n+3 vertices. The multiplicative Wiener index of a connected simple graph G is defined as the product of the distances between all pairs of distinct vertices of G. The wheel graph with n+3 vertices has (n+3)(n+2)/2 pairs of distinct vertices, of which 2(n+2) are adjacent; each of the remaining (n+2)(n-1)/2 pairs are at distance 2; consequently, the multiplicative Wiener index is 2^((n-1)(n+2)/2) = a(n). - Emeric Deutsch, Aug 17 2015

Programs

Formula

a(1) = 1, a(n) = a(n-1) * 2^n. - Vincenzo Librandi, Oct 24 2012