24704

Appears in sequences

• a(n) = (2*(1 + n + (((10^n-1)/9) - n)/9)).at n=6A036544
• Gaps of 8 in sequence A038593 (upper terms).at n=17A038656
• Numbers k such that k^4 + 1, (k+2)^4 + 1 and (k+4)^4 + 1 are all primes.at n=20A073476
• a(n) is the smallest number k such that A033880(k)= n, or 0 if no such number exists, where A033880 is the abundance of k.at n=62A082731
• a(n) = smallest number x such that sigma(x) = 2x + 2n.at n=31A087998
• Number of occurrences of pattern 1-2 after n iterations of morphism A007413.at n=7A093356
• Triangular array read by rows: a(n, k) = sum of number of ordered factorizations of all prime signatures with n total prime factors and k distinct prime factors.at n=25A095705
• a(n) = p*(p+(2n-1))/2, where p = A096822(n) is the smallest primes of form 2^x-(2n-1).at n=31A096823
• a(n)=n for n <= 3, a(n) = 2a(n-1) - 2a(n-2) + 2a(n-3) for n >= 4.at n=24A104767
• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, -1, 1), (-1, 0, -1), (1, 0, 1), (1, 1, 0)}.at n=8A150352
• Number of n X n 0..4 arrays with each element x equal to the number of its horizontal and vertical neighbors equal to 0,1,1,0,0 for x=0,1,2,3,4.at n=5A197310
• Number of nX6 0..4 arrays with each element x equal to the number its horizontal and vertical neighbors equal to 0,1,1,0,0 for x=0,1,2,3,4.at n=5A197315
• T(n,k)=Number of nXk 0..4 arrays with each element x equal to the number of its horizontal and vertical neighbors equal to 0,1,1,0,0 for x=0,1,2,3,4.at n=60A197317
• Number of (w,x,y,z) with all terms in {1,...,n} and w > |x-y| + |y-z|.at n=16A212674
• Even numbers in A221715.at n=44A213218
• Numbers of the form (24*x + 1)*2^(y+6) with positive integers x and y.at n=11A231203
• Number of (7+2) X (n+2) 0..3 arrays with every consecutive three elements in every row and diagonal having exactly two distinct values, and in every column and antidiagonal not having exactly two distinct values, and new values 0 upwards introduced in row major order.at n=26A252726
• Primitive practical numbers of the form 2^i * prime(k).at n=42A308710
• Consider constructing binary words that begin with 0 such that the subword 00, whenever it appears, is followed by 111. Then a(n) counts such words at length n (including those where the string 111 is yet being completed - see Example).at n=19A340215
• Numbers k such that k and k+1 are products of at least 6 primes.at n=35A346207