29281

Appears in sequences

• Number of acyclic digraphs (or DAGs) with n labeled nodes.at n=5A003024
• Bruckman-Lucas pseudoprimes: k | (L_k - 1), where k is composite and L_k = Lucas numbers A000032.at n=11A005845
• Numerators of continued fraction convergents to sqrt(915).at n=3A042768
• Numbers having four 4's in base 9.at n=9A043472
• Numbers whose base-3 representation contains exactly one 0 and no 2's.at n=40A044994
• Numbers k such that k^10 == 1 (mod 11^4).at n=19A056094
• Shallow diagonal of triangular spiral in A051682.at n=40A081275
• Number of A095285-primes in range ]2^n,2^(n+1)].at n=18A095295
• Number of A095323-primes in range ]2^n,2^(n+1)].at n=18A095325
• a(n) = 128*n^2 + 32*n + 1.at n=14A157337
• 128n^2 + 2336n + 10657.at n=5A157433
• a(n) = 2*11^n-1.at n=4A198974
• Number of -2..2 arrays of n elements with first through fourth differences also in -2..2.at n=13A202658
• Number of (n+1)X(6+1) 0..2 arrays with nondecreasing x(i,j)+x(i,j-1) in the i direction and nondecreasing absolute value of x(i,j)-x(i-1,j) in the j direction.at n=0A250940
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with nondecreasing x(i,j)+x(i,j-1) in the i direction and nondecreasing absolute value of x(i,j)-x(i-1,j) in the j direction.at n=15A250942
• Number of (1+1) X (n+1) 0..2 arrays with nondecreasing x(i,j)+x(i,j-1) in the i direction and nondecreasing absolute value of x(i,j)-x(i-1,j) in the j direction.at n=5A250943
• a(n) gives the odd leg of one of the two Pythagorean triangles with hypotenuse A080109(n) = A002144(n)^2. This is the smaller of the two possible odd legs.at n=23A253802
• Bases in which 11 is a unique-period prime.at n=32A306076
• Odd composite integers m such that F(m)^2 == 1 (mod m), where F(m) is the m-th Fibonacci number.at n=36A337231
• Odd composite integers m such that F(m)^2 == 1 (mod m) and L(m) == 1 (mod m), where F(m) and L(m) are the m-th Fibonacci and Lucas numbers, respectively.at n=7A337625