409573

Properties

Appears in sequences

• Number of tilings of a 3 X n rectangle with n trominoes.at n=14A134438
• Let p_(3,1)(m) be the m-th prime == 1(mod 3). Then a(n) is the smallest p_(3,1)(m) such that the interval(p_(3,1)(m)*n, p_(3,1)(m+1)*n) contains exactly one prime == 1(mod 3).at n=37A210465
• Prime numbersat n=34576