Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A006044
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A006044 A traffic light problem.
(Formerly M4290)
+0
1
6, 96, 960, 7680, 53760, 344064, 2064384, 11796480, 64880640, 346030080, 1799356416, 9160359936, 45801799680, 225485783040, 1095216660480, 5257039970304, 24970939858944, 117510305218560, 548381424353280, 2539871860162560, 11683410556747776, 53409876830846976 (list; graph; listen)
OFFSET

4,1

COMMENT

I have derived the terms in a rather laborius way (see the Maple program), following the Haight paper, where the signed sequence occurs. The simple g.f. for the positive sequence is conjectured by analogy with A006043. For the signed sequence it is, obviously, 6x^4/(1+4x)^4. The Maple program, probably not the simplest one, is for the signed sequence. - Emeric Deutsch (deutsch(AT)duke.poly.edu), Apr 29 2004

REFERENCES

F. A. Haight, Overflow at a traffic light, Biometrika, 46 (1959), 420-424.

FORMULA

It seems that G.f.= 6x^4/(1-4x)^4 (for the positive sequence). - Emeric Deutsch (deutsch(AT)duke.poly.edu), Apr 29 2004

MAPLE

A:=(u, r)->r*u^(u-r-1)/(u-r)!: a:=proc(i, j) if j>i+1 then 0 elif j=i+1 then 1 else A(z-j+1, z-i) fi end: with(linalg): B:=proc(z, x) if z=x then 1 else (-1)^(z+x)*det(matrix(z-x, z-x, a)) fi end: seq(expand(subs(z=k, (z-1)!*B(k, 4))), k=4..26);

CROSSREFS

Adjacent sequences: A006041 A006042 A006043 this_sequence A006045 A006046 A006047

Sequence in context: A053338 A055358 A030989 this_sequence A001805 A038094 A126151

KEYWORD

sign

AUTHOR

njas

EXTENSIONS

More terms from Emeric Deutsch (deutsch(AT)duke.poly.edu), Apr 29 2004

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified May 16 01:24 EDT 2008. Contains 139630 sequences.


AT&T Labs Research