-631

Appears in sequences

• a(n) = bin_prime_sum(fibonacci(A001651[n])), where fibonacci(A001651[n]) is A014437[n].at n=46A059878
• Abundance values of numbers whose abundance is (+-1) times a prime.at n=46A088006
• Matrix inverse of triangle A107862.at n=51A107865
• a(n,m) =Floor[N[(-2 + Sqrt[3])^n + (-2 - Sqrt[3])^n]/2^m].at n=24A117809
• Hankel transform of a simple Catalan convolution.at n=5A167423
• a(n+1) = a(n-1) + 2 a(n-2) - a(n-4) ; a(0)=1, a(n)=0 for 0 < n < 5.at n=25A181560
• Prime-generating polynomial: a(n) = 4*n^2 + 12*n - 1583.at n=14A182409
• Values of the prime-generating polynomial 4*n^2 - 284*n + 3449.at n=20A210626
• First differences of number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 475", based on the 5-celled von Neumann neighborhood.at n=17A272450
• a(n) = exp(n) * Sum_{k>=0} (-n)^k * (k - 1)^n / k!.at n=5A335868
• Numerator generator for offsets from the quarter points of the Cantor ternary set to the center points of deleted middle thirds: 1 is in the list and if m is in the list -3m-4 and -3m+4 are in the list, which is ordered by absolute value.at n=25A355680
• Dirichlet inverse of function f(n) = 1+(A003415(n)*A276086(n)), where A003415 is the arithmetic derivative and A276086 is the primorial base exp-function.at n=40A359603