The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A006044 (Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing entries 1-10 | older changes

A006044

a(n) = 4^(n-4)*(n-1)*(n-2)*(n-3).
(history; published version)

#63 by Michel Marcus at Sun Jan 08 02:39:53 EST 2023

STATUS

reviewed

approved

#62 by Joerg Arndt at Sun Jan 08 02:22:02 EST 2023

STATUS

proposed

reviewed

#61 by Amiram Eldar at Sun Jan 08 01:38:50 EST 2023

STATUS

editing

proposed

#60 by Amiram Eldar at Sun Jan 08 01:00:24 EST 2023

LINKS

F. Frank A. Haight, <a href="http://www.jstor.org/stable/2333538">Overflow at a traffic light</a>, Biometrika, 46 (1959), 420-424.

F. Frank A. Haight, <a href="/A001787/a001787_3.pdf">Overflow at a traffic light</a>, Biometrika, 46 (1959), 420-424. (Annotated scanned copy)

F. Frank A. Haight, <a href="/A001787/a001787_2.pdf">Letter to N. J. A. Sloane, n.d.</a>.

MATHEMATICA

a[n_] := 4^(n - 4)*(n - 1)*(n - 2)*(n - 3); Array[a, 25, 4] (* Amiram Eldar, Jan 08 2023 *)

#59 by Amiram Eldar at Sun Jan 08 00:57:52 EST 2023

FORMULA

From Amiram Eldar, Jan 08 2023: (Start)

Sum_{n>=4} 1/a(n) = 18*log(4/3) - 5.

Sum_{n>=4} (-1)^n/a(n) = 50*log(5/4) - 11. (End)

STATUS

approved

editing

#58 by Michael De Vlieger at Sun Jan 01 19:31:00 EST 2023

STATUS

reviewed

approved

#57 by Michel Marcus at Sun Jan 01 14:47:04 EST 2023

STATUS

proposed

reviewed

#56 by Stefano Spezia at Sun Jan 01 13:05:37 EST 2023

STATUS

editing

proposed

#55 by Stefano Spezia at Sun Jan 01 12:55:05 EST 2023

CROSSREFS

Cf. A000142, A006043, A038846, A152818, A154120.

#54 by Stefano Spezia at Sun Jan 01 12:44:09 EST 2023

LINKS

<a href="/index/Rec#order_04">Index entries for linear recurrences with constant coefficients</a>, signature (16,-96,256,-256).