|
| |
|
|
A187734
|
|
a(n) is the number of n-walks between the vertices 1 and 3 of the Graph on the chalkboard in 'Good Will Hunting', (1997).
|
|
0
|
|
|
|
0, 2, 2, 14, 18, 94, 146, 638, 1138, 4382, 8658, 30398, 64818, 212574, 479890, 1496062, 3525106, 10581918, 25748306, 75139390, 187301554, 535144670, 1358396434, 3820058238, 9829858162, 27316621854, 71015537874, 195595836350, 512422576178, 1401935442782
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
1,2
|
|
|
COMMENTS
|
For a presentation of the Graph, see the first link.
|
|
|
REFERENCES
|
Burkard Polster & Marty Ross, Math Goes to the Movies, The Johns Hopkins University Press, Baltimore, 2013, §1.7 Mathematics: Graph Theory 1, pp. 9-12.
|
|
|
LINKS
|
MMDB-The Mathematical Movie Database, Burkard Polster & Marty Ross, Good Will Hunting
|
|
|
FORMULA
|
G.f.: 2*x^2/(1 - x - 6*x^2 + 4*x^3).
|
|
|
EXAMPLE
|
"For example, between the vertices 1 and 3, we can calculate that there are no 1-walks, two 2-walks, two 3-walks and so on. The resulting sequence of numbers begins 0, 2, 2, 14, 18, 94, 146, 638, ..." (p. 11).
|
|
|
MATHEMATICA
|
LinearRecurrence[{1, 6, -4}, {0, 2, 2}, 30] (* Or *)
Rest@ CoefficientList[Series[2x^2/(1 - x - 6x^2 + 4x^3), {x, 0, 28}], x]
|
|
|
PROG
|
|
|
|
CROSSREFS
|
|
|
|
KEYWORD
|
nonn,easy,walk
|
|
|
AUTHOR
|
Oliver Knill (knill(AT)math.harvard.edu), Burkard Polster (burkard.polster(AT)monash.edu), Marty Ross (martinirossi(AT)gmail.com), and Robert G. Wilson v, Jan 02 2013
|
|
|
STATUS
|
approved
|
| |
|
|
