23701

Appears in sequences

• a(n) = 1*t(n) + 2*t(n-1) + ... + k*t(n+1-k), where k=floor((n+1)/2) and t = A008578 ({1} U primes).at n=40A023862
• Euler transform of A027656(n-1).at n=31A035528
• Number of combinatorial types of n-dimensional polytopes with n+3 vertices.at n=9A114289
• Composite numbers whose concatenation of their aliquot parts, in descending order, is a palindrome.at n=29A249301
• Semiprimes whose prime factors are of equal binary length and which differ from each other in exactly two bit positions.at n=48A261074
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 179", based on the 5-celled von Neumann neighborhood.at n=32A270624
• Worst cases for Hart's one-line factorization (OLF) method with multiplier M = 1, see comments.at n=10A284522
• Solution of the complementary equation a(n) = a(n-1) + a(n-2) + b(n-2) - 1, where a(0) = 1, a(1) = 2, b(0) = 3.at n=18A294536
• A Catalan-like sequence formed from the row sums of a Catalan-like triangle where row n is truncated to have ceiling((n+4)*log(3)/log(2)) - (n + 6) terms.at n=12A374244