29089

Appears in sequences

• Strong pseudoprimes to base 80.at n=19A020306
• Numbers k such that 131*2^k+1 is prime.at n=29A032415
• Number of 6 X n binary arrays with a path of adjacent 1's from top row to bottom row.at n=2A069364
• Number of n X 3 binary arrays with a path of adjacent 1's from top row to bottom row.at n=5A069378
• Interprimes which are of the form s*prime, s=19.at n=8A075294
• Records in A007535.at n=38A098654
• Numerator of Sum_{k=1..n}(-1)^k/phi(k), where phi = A000010.at n=32A211177
• Number of unlabeled rooted trees with n nodes and maximal outdegree (branching factor) 8.at n=10A244404
• Number of nX3 0..1 arrays with every element equal to 0, 3, 4, 5 or 6 king-move adjacent elements, with upper left element zero.at n=14A298439
• Number of triples (i,j,k) such that i+j+k > 0 with -n <= i,j,k <= n.at n=19A302302
• Number of integer partitions of n with no part dividing all the others.at n=50A338470
• a(n) is the least number k such that {k, k^2, ..., k^n} are all odious numbers (A000069), but k^(n+1) is not.at n=10A345399
• Triangle read by rows: T(n,k) is the number of digraphs on n unlabeled nodes with k arcs and a global source (or sink), n >= 1, k = 0..(n-1)^2.at n=46A350797
• Array read by antidiagonals: T(m,n) is the number of m X n binary arrays with a path of adjacent 1's from top row to bottom row.at n=33A359576
• Array read by antidiagonals: T(m, n) is the number of m X n binary arrays with a path of adjacent 1's from top row to bottom row using only left, right, and downward steps.at n=33A369892
• Consecutive states of the linear congruential pseudo-random number generator 259*s mod 2^15 when started at s=1.at n=8A384194