136214

Appears in sequences

• a(n) = (F(2n+1) + F(2n-1) + F(n+3) - 2)/2, where F() = Fibonacci numbers A000045.at n=12A005593
• a(0) = 1, a(n) = k*a(n-1) + 1 is a multiple of n-th prime. If no such number exists then a(n) = 0 and a(n+1) = k*a(n-1) + 1 is a multiple of (n+1)-th prime; i.e., a(r) = smallest multiple of the r-th prime = k* a(s) + 1 where a(s) is the last nonzero term.at n=11A069565
• First of three consecutive numbers with at least one 3 in their prime signature.at n=16A176350
• Number of set partitions of [n] such that the maximal absolute difference between consecutive elements within a block equals three.at n=8A294052
• Starts of runs of 3 consecutive numbers that have an equal number of unitary and nonunitary divisors (A048109).at n=12A335397