40465

Appears in sequences

• A Fibonacci convolution.at n=12A099484
• Numbers k such that both the k-th and (k+1)-th primes have the same sum of digits squared but different sets of digits.at n=21A109183
• Number of partitions of n such that the largest part is a multiple of the smallest part.at n=40A117086
• Irregular table read by rows, in which row n lists the factorions in base n, for n >= 2.at n=47A193163
• a(n) is the number of noncomposites (primes or 1) that are n digits long in balanced ternary notation.at n=12A233919
• Let a(n) be the least k such that in the prime power factorization of k! the exponents of primes p_1, ...,p_n are even, while the exponent of p_(n+1) is odd.at n=14A240537
• a(n) = ceiling(Fibonacci(n)/3).at n=26A293543
• a(n) is equal to the sum of the factorials of the digits of a(n-1), with a(1) = 0; each time a duplicated term appears, we replace it with the smallest integer not yet in the sequence and iterate.at n=24A351328
• Upper (1/3)-midsequence of (F(2n)) and (F(2n+1)), where F=A000045 (Fibonacci numbers); see Comments.at n=12A387783