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).

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).

Terms

    a(0) =0a(1) =2a(2) =2a(3) =14a(4) =18a(5) =94a(6) =146a(7) =638a(8) =1138a(9) =4382a(10) =8658a(11) =30398a(12) =64818a(13) =212574a(14) =479890a(15) =1496062a(16) =3525106a(17) =10581918a(18) =25748306a(19) =75139390a(20) =187301554a(21) =535144670a(22) =1358396434a(23) =3820058238a(24) =9829858162a(25) =27316621854a(26) =71015537874a(27) =195595836350a(28) =512422576178

External references