28943

Appears in sequences

• a(n) = 3^(n-1)*(2*n-3) + 2^(n+1).at n=8A084643
• Brilliant numbers k such that 2k+1 is also brilliant.at n=15A085649
• a(1) = a(2) = 1. For n >=3, a(n) = the a(n-2)th integer, among those positive integers which are missing from the first (m-1) terms of the sequence, below a(n-1) if such a positive integer exists. Otherwise, a(n) = the a(n-2)th integer, among those positive integers which are missing from the first (m-1) terms of the sequence, above a(n-1).at n=37A118627
• a(n) = Sum_{k <= n/2 } k*binomial(n-2k, 3k+1).at n=20A137360
• Number of length 4+1 0..n arrays with the sum of the squares of adjacent differences multiplied by some arrangement of +-1 equal to zero.at n=13A250279
• Total number of divisors d of m (counted with multiplicity), such that the prime signature of d is a partition of six and m runs through the set of least numbers whose prime signature is a partition of n.at n=8A309921
• Total number of divisors d of m (counted with multiplicity), such that the prime signature of d is a partition of eight and m runs through the set of least numbers whose prime signature is a partition of n.at n=6A309923
• Consecutive states of the linear congruential pseudo-random number generator (1255*s + 6173) mod 29282 when started at s=1.at n=6A385339