61560

Appears in sequences

• Base 4 digital convolution sequence.at n=15A033641
• Values of m such that N=(am+1)(bm+1)(cm+1) is a 3-Carmichael number (A087788), where a,b,c = 1,2,13.at n=19A064243
• Numbers m such that N=(am+1)(bm+1)(cm+1) is a 3-Carmichael number (A087788), where a,b,c = 1,2,39.at n=16A064256
• Number of numbers k which give 1 after applying exactly n iterations of the 3k+1 algorithm (if a number is even, divide it by 2; if it is odd, multiply by 3 and add 1). This total includes numbers k which also give 1 for a smaller number of iterations (i.e., for this sequence we do not assume the algorithm halts when 1 is reached).at n=46A082538
• Averages of twin prime pairs that are sums of 4 consecutive averages of twin prime pairs.at n=31A160918
• Number of edges in the n^2 X n^2 Sudoku graph.at n=5A182866
• Triangle T(n,k) for solving differential equation A'(x)=G(A(x)), G(0)!=0.at n=54A190015
• Numbers with prime factorization pqr^3s^4.at n=17A190294
• Number of 4 X n 0..1 arrays avoiding 0 0 0 and 0 0 1 horizontally and 0 0 1 and 1 1 1 vertically.at n=8A207591
• (prime(n)^2 -1)*(prime(n)^2 - prime(n))/2.at n=7A230325
• Numbers k such that k+1 is a prime, k+2 is twice a prime, k+3 is three times a prime, and k+4 is four times a prime.at n=5A278585
• Values of bsigma(k) = bsigma(k+1), where bsigma is the sum of the bi-unitary divisors (A188999).at n=32A294029
• Numbers i such that Fibonacci(i) is divisible by i, i+1, i+2, and i+3.at n=21A298685
• Numbers i such that Fibonacci(i) is divisible by i+k for k=0,1,2,3,4.at n=5A298686
• Irregular table read by rows: Take an octagon with all diagonals drawn, as in A333075. Then T(n,k) = number of k-sided polygons in that figure for k >= 3.at n=33A333076
• a(n) is the number of smallest parts in the overpartitions of n having even smallest part.at n=32A335728
• Least k whose set of divisors contains exactly n quadruples (x, y, z, w) such that x^3 + y^3 + z^3 = w^3, or 0 if no such k exists.at n=36A337098
• a(n) is the determinant of the 2 X 2 matrix whose entries (when read by rows) are the n-th primes congruent to 1, 3, 5, 7 mod 8 respectively.at n=20A337145
• Members of A014574 with sum of prime factors (with multiplicity) also in A014574.at n=37A349455
• a(n) = n! * Sum_{k=0..floor(n/2)} k^(2*n)/k!.at n=5A357193