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.

A186340 a(n) = 2^A001840(n).

Original entry on oeis.org

1, 2, 4, 8, 32, 128, 512, 4096, 32768, 262144, 4194304, 67108864, 1073741824, 34359738368, 1099511627776, 35184372088832, 2251799813685248, 144115188075855872, 9223372036854775808, 1180591620717411303424, 151115727451828646838272
Offset: 0

Views

Author

Paul Barry, Feb 18 2011

Keywords

Comments

A factor in the Hankel transform A186339 of A186338.
a(n)*a(n-4) = 2*a(n-1)*a(n-3) = a(n-1)*a(n-3) + c(n)*a(n-2)^2, where c(3*n+2) = 2, c(3*n) = c(3*n+1) = 1 for all n in Z. - Michael Somos, Oct 19 2018

Examples

			G.f. = 1 + 2*x + 4*x^2 + 8*x^3 + 32*x^4 + 128*x^5 + 512*x^6 + ... - _Michael Somos_, Oct 19 2018
		

Crossrefs

Cf. A058937.

Programs

  • Mathematica
    a[ n_] := 2^Quotient[ Binomial[n + 2, 2], 3]; (* Michael Somos, Oct 19 2018 *)
  • PARI
    {a(n) = 2^(binomial(n+2, 2)\3)}; /* Michael Somos, Oct 19 2018 */

Formula

a(n)=2^floor((n+1)(n+2)/6).