44281

Properties

Appears in sequences

• a(0)=1, a(n) = 3*a(n-1) + n + 1.at n=9A000340
• Triangle read by rows: T(n,k) is the number of permutations of [n] with k increasing runs of length at least 2.at n=37A008971
• Conjecturally, number of infinitely-recurring prime patterns on n consecutive integers.at n=40A023192
• Numbers having four 6's in base 9.at n=25A043480
• a(n) = (2*n^3 + 3*n^2 + n + 3)/3.at n=40A188475
• Indices of primes in the tribonacci-like sequence A214827.at n=32A242324
• Smallest index k such that Fibonacci(k) contains Fibonacci(n) as a proper substring in decimal notation.at n=43A263400
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 43", based on the 5-celled von Neumann neighborhood.at n=40A269878
• Twin primes both of which are the sum of three positive cubes.at n=33A272376
• a(n) is the smallest prime p such that there is a multiplicative subgroup H of Z/pZ, of odd size and of index 2n, such that for any two cosets H1 and H2 of H, H1 + H2 contains all of (Z/pZ)\0.at n=35A282001
• In a Kolakoski n-chain, point at which term of penultimate sequence seq(n-1) differs from term of final sequence seq(n) in chain, when terms of seq(i) are run-lengths of seq(i+1) and the chain contains n sequences.at n=26A327421
• a(n) is the number of distinct scalar products which can be formed by pairs of signed permutations (V, W) of [n].at n=40A358655
• Prime numbersat n=4611