25213

Appears in sequences

• Random walks (binomial transform of A006054).at n=8A005021
• All 81 combinations of prefixing and following a(n) by a single digit are nonprime.at n=11A032734
• T(n,n-1), array T given by A047000.at n=9A047003
• Expansion of (1-x)/(1-x-2*x^2+x^3).at n=19A052547
• Pseudo-random numbers: Davenport's generator for 32-bit integers.at n=3A084277
• Equal count of primes congruent to 1 mod 4 and 3 mod 4 associated with primes in A007351 (the zero beginning the sequence indicates the prime 2).at n=20A092198
• Number of walks of length n on P_3 plus a loop at the end.at n=21A096976
• a(n)=5a(n-1)-11a(n-2)+13a(n-3)-9a(n-4)+3a(n-5)-a(n-6).at n=20A140342
• a(n) = n^2 + 731*n + 1.at n=33A180919
• Let i be in {1,2,3} and let r >= 0 be an integer. Let p = {p_1, p_2, p_3} = {-2,0,1}, n=2*r+p_i, and define a(-2)=1. Then, a(n)=a(2*r+p_i) gives the quantity of H_(7,1,0) tiles in a subdivided H_(7,i,r) tile after linear scaling by the factor x^r, where x=sqrt(2*cos(Pi/7)).at n=40A187065
• Let i be in {1,2,3} and let r >= 0 be an integer. Let p = {p_1, p_2, p_3} = {-2,0,1}, n=2*r+p_i, and define a(-2)=0. Then, a(n)=a(2*r+p_i) gives the quantity of H_(7,2,0) tiles in a subdivided H_(7,i,r) tile after linear scaling by the factor x^r, where x=sqrt(2*cos(Pi/7)).at n=38A187066
• Number of nX8 binary arrays without the pattern 0 1 diagonally or vertically.at n=3A188842
• a(n) = a(n-1) + a(n-2) if n is even and a(n) = a(n-3) + a(n-4) if n is odd, with a(0) = a(1) = a(2) = 0 and a(3) = 1.at n=41A265755
• Number of necklace compositions of n such that every restriction to a circular subinterval has a different sum.at n=48A325681
• Starhex honeycomb numbers: a(n) = 13 + 60*n + 60*n^2.at n=20A332243
• Numbers m such that numbers m, m + 1, m + 2 and m + 3 have k, 2k, 3k and 4k divisors respectively.at n=15A340157