22765

Appears in sequences

• a(n) = a(n-1) + a(n-4) with a(0) = 0, a(1) = a(2) = a(3) = 1.at n=34A003269
• Expansion of (1-x)/(1-x-x^4).at n=37A017898
• Numbers k such that the continued fraction for sqrt(k) has period 51.at n=37A020390
• Triangle of Gaussian binomial coefficients [ n,k ] for q = 12.at n=12A022176
• Numbers whose square is palindromic in base 12.at n=29A029737
• Numbers whose set of base-12 digits is {1,2}.at n=34A032932
• a(n) = n^3 + n^2 + n + 1.at n=28A053698
• a(n) is its own 4th difference.at n=8A055989
• a(n) = least solution k of f(k) = f(k-1) + ... + f(k-n), where f(m) = prime(m+1)-prime(m) and prime(m) denotes the m-th prime, if k exists; 0 otherwise.at n=7A066496
• A trisection of 1/(1-x-x^4).at n=11A099234
• Sum C(n-3k,k-1), k=0..floor(n/4).at n=36A099561
• INVERT transform of A027656: (1, 0, 2, 0, 3, 0, 4, 0, 5, ...).at n=16A158943
• a(n) = prime(n)^2 - n.at n=35A182174
• a(n) = (28^n - 1)/27.at n=4A218731
• Number of polynomials a_k*x^k + ... + a_1*x + a_0 with k > 0, integer coefficients and only non-multiple positive integer roots and a_0 = p^n (p is a prime).at n=42A248956
• Numbers k such that 3^k + k*2^k is prime.at n=15A270104
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 99", based on the 5-celled von Neumann neighborhood.at n=32A270158
• The least common multiple of 1+n and 1+n^2.at n=28A281660
• Number of compositions (ordered partitions) of n into nonprime parts not greater than sqrt(n).at n=33A368873
• Number of compositions (ordered partitions) of n into squares not greater than sqrt(n).at n=33A369342