31330

Appears in sequences

• Fibonacci sequence beginning 1, 19.at n=17A022109
• a(n) = Sum_{i=1..floor((n+1)/4)} a(2*i-1) * a(n-2*i+1), with a(1)=a(2)=1 and a(3)=5.at n=15A024729
• a(n) = n*F(n-1) + F(n), where F = A000045.at n=18A094588
• Numbers whose square is a fourth power plus a prime.at n=27A236767
• Differential autobiographical numbers: number n = x0 x1 x2 ... x9 such that xi is the number of pairs (xj, xk), j different from k, where |xj - xk| = i.at n=1A256104
• a(n) = floor( prime(n)^3 / (n*log(n)) ).at n=36A259648
• Numbers n such that n*9^n + 1 is prime.at n=3A265013
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 779", based on the 5-celled von Neumann neighborhood.at n=29A273540
• Number of sets of exactly six positive integers <= n having a square element sum.at n=24A281866
• Numbers of the form m^2 + 1 that can be expressed in more than one way as j^2 + k^2 with j > k > 1.at n=34A299708
• Numbers of the form m^2 + 1 that can be expressed in more than one way as j^2 + k^2 with j > k > 1 and gcd(j,k) = 1.at n=19A300166
• G.f.: Product_{k>=1, j>=1} 1/(1 - x^(k*j))^2.at n=14A320236
• G.f. A(x) satisfies A(x) = (1 + x*A(x)^(3/4) / (1-x))^4.at n=6A370695
• A Catalan-like sequence formed by summing the truncation of the terms of the fourth convolution of the Catalan Triangle where the number of row terms are truncated to ceiling((n+4)*log(3)/log(2)) - (n+4).at n=10A376319