27391

Appears in sequences

• Add 1, multiply by 1, add 2, multiply by 2, etc.; start with 0.at n=14A019461
• Strong pseudoprimes to base 79.at n=21A020305
• a(n) = n*(n + a(n-1)) with a(0)=0.at n=7A030297
• Base-9 palindromes that start with 4.at n=34A043031
• Number of distinct values produced from sums and products of n unity arguments.at n=30A048249
• Numbers k such that lcm(1,2,3,...,k)/13 equals the denominator of the k-th harmonic number H(k).at n=17A112818
• Triangle read by rows: T(i,j) = (T(i-1,j) + i)*i.at n=21A121682
• a(1) = 1. If a(n) is prime, a(n+1) = 2*a(n); otherwise, a(n+1) = 2*a(n) + 1.at n=14A125049
• Number of nodes (or order) of a graph model obtained using an automata scheme on sets of order prime(n) >= 5 and in which all not halt states are linked by arcs (edges).at n=36A160772
• Number of (n+2) X 7 0..2 arrays with every 3 X 3 subblock commuting with each horizontal and vertical neighbor 3 X 3 subblock.at n=6A186564
• Number of (n+2)X9 0..2 arrays with every 3X3 subblock commuting with each horizontal and vertical neighbor 3X3 subblock.at n=4A186566
• a(n) is the genus of the modular curve associated to the principal congruence subgroup of level p(n), where p(n) is the n-th prime number.at n=22A191590
• a(n) = Sum_{0<j<n} n^3-j^3.at n=12A206808
• Expansion of 1/((1+x)*(1+2*x)*(1-3*x)).at n=10A249992
• Numbers n such that n*2^2281 - 1 is prime.at n=23A265504
• Number of triples 0 <= i, j, k < n such that bitwise AND of i, j, k is 0.at n=35A269589
• Triangle read by rows, T(n, k) = S(k, n) with S(n, n) = 1, S(0, n) = 0 and otherwise S(k,n) = Sum_{i=1..n-k+1} k^i*S(k-1, n-i), for n>=0 and 0<=k<=n.at n=43A269955
• Sum over all partitions of n into distinct parts of the bitwise OR of the parts.at n=40A306924
• Triangle read by rows: T(n,k) is the number of multiset partitions of weight n whose union is a k-set where each part has a different size.at n=52A332253
• Square array T(n,k), n>=0, k>=0, read by antidiagonals, where T(n,k) = n! * Sum_{j=0..n} j^k/j!.at n=52A337085