479890

Appears in sequences

• Numbers in which all pairs of consecutive base-6 digits differ by 3.at n=35A033077
• Let M = 2 X 2 matrix [ 1 2 / 5 4 ]; a(n) = (1,2) entry of M^n.at n=7A092165
• 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).at n=14A187734