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.

A302924 Central moments of a Fibonacci-geometric probability distribution.

Original entry on oeis.org

1, 0, 22, 210, 4426, 102330, 2906362, 95952570, 3622138906, 153816150810, 7257695358202, 376693381614330, 21328770664314586, 1308295248437904090, 86423208789970618042, 6116714829331037666490, 461779664078480243085466, 37040796099362864616022170
Offset: 0

Views

Author

Albert Gordon Smith, Apr 15 2018

Keywords

Comments

If F(k) is the k-th Fibonacci number, where F(0)=0, F(1)=1, and F(n)=F(n-1)+F(n-2), then p(k)=F(k-1)/2^k is a normalized probability distribution on the positive integers.
For example, it is the probability that k coin tosses are required to get two heads in a row, or the probability that a random series of k bits has its first two consecutive 1's at the end.
The g.f. for this distribution is g(x) = x^2/(4-2x-x^2) = (1/4)x^2 + (1/8)x^3 + (1/8)x^4 + (3/32)x^5 + ....
The mean of this distribution is 6. (See A302922.)
The n-th moments about the mean, known as central moments, are defined by a(n) = Sum_{k>=1} ((k-6)^n)p(k). They appear to be integers and form this sequence.
For n >= 1, a(n) appears to be even. Dividing these terms by 2 gives sequence A302925.
The raw moments (i.e., the moments about zero) also appear to be integers. This is sequence A302922.
The raw moments also appear to be even for n >= 1. Dividing them by 2 gives sequence A302923.
The cumulants of this distribution, defined by the cumulant e.g.f. log(g(e^x)), also appear to be integers. They form sequence A302926.
The cumulants also appear to be even for n >= 0. Dividing them by 2 gives sequence A302927.
Note: Another probability distribution on the positive integers that has integral moments and cumulants is the geometric distribution p(k)=1/2^k. The sequences related to these moments are A000629, A000670, A052841, and A091346.

Examples

			a(0)=1 is the 0th central moment of the distribution, which is the total probability.
a(1)=0 is the 1st central moment, or the "mean about the mean". It is zero by definition of central moments.
a(2)=22 is the 2nd central moment, known as the variance or the square of the standard deviation. It measures how far integers following the distribution are from the mean by averaging the squares of their differences from the mean.
		

Crossrefs

Central half-moments: A302925.
Raw moments: A302922.
Raw half-moments: A302923.
Cumulants: A302926.
Half-cumulants: A302927.

Programs

  • Mathematica
    Module[{max, r, g, moments},
      max = 17;
      r = Range[0, max];
      g[x_] := x^2/(4 - 2 x - x^2);
      moments = r! CoefficientList[Normal[Series[g[Exp[x]], {x, 0, max}]], x];
      Table[Sum[Binomial[n, k] moments[[k + 1]] (-6)^(n - k), {k, 0, n}], {n, 0, max}]
    ]

Formula

In the following,
F(k) is the k-th Fibonacci number, as defined in the Comments.
phi=(1+sqrt(5))/2 is the golden ratio, and psi=(1-sqrt(5))/2.
LerchPhi(z,s,a) = Sum_{k>=0} z^k/(a+k)^s is the Lerch transcendant.
For n >= 0:
a(n) = Sum_{k>=1} (((k-6)^n)(F(k-1)/2^k));
a(n) = Sum_{k>=1} (((k-6)^n)(((phi^(k-1)-psi^(k-1))/sqrt(5))/2^k));
a(n) = (LerchPhi(phi/2,-n,-5)-LerchPhi(psi/2,-n,-5))/(2 sqrt(5));
a(n) = Sum_{k=0..n} (binomial(n,k)*A302922(k)*(-6)^(n-k)).