23341

Appears in sequences

• Define the sequence T(a(0),a(1)) by a(n+2) is the greatest integer such that a(n+2)/a(n+1) < a(n+1)/a(n) for n >= 0. This is T(4,10).at n=10A019494
• Number of partitions of n into parts not of the form 25k, 25k+8 or 25k-8. Also number of partitions with at most 7 parts of size 1 and differences between parts at distance 11 are greater than 1.at n=38A036007
• Numbers having four 5's in base 8.at n=14A043444
• Concatenation of n-th Fibonacci number and n-th prime.at n=12A138821
• Numbers that are 5-digit palindromes in at least two bases.at n=26A180454
• Numerators of row sums of the triangle (lower triangular matrix) log(F) with F:=A037027 (Fibonacci convolution matrix).at n=12A181349
• Smallest palindromic number of 5 digits in two bases differing by n.at n=3A216899
• Number of (n+5)X1 arrays of occupancy after each element moves up to +-5 places but not 0.at n=3A222552
• T(n,k)=Number of length (n+k)X1 arrays of occupancy after each element moves up to +-k places but not 0.at n=31A222555
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 157", based on the 5-celled von Neumann neighborhood.at n=32A270331
• a(n) is the row of the Trithoff (tribonacci) array that contains the tails of the sequence which is n times the tribonacci numbers.at n=29A351685
• The indices where A354606(n) = 1.at n=35A355606