32604

Appears in sequences

• Number of loopless multigraphs with 6 nodes and n edges.at n=13A014396
• Powers of fifth root of 6 rounded down.at n=29A018129
• Powers of fifth root of 6 rounded to nearest integer.at n=29A018130
• Expansion of (1-4*x)^(19/2).at n=17A020931
• a(n) = a(n-1) + a(n-2) + 1, with a(0) = 0 and a(1) = 11.at n=18A022316
• a(n) = a(1) + a(2) + ... + a(n-1) - a(m) for n >= 4, where m = 2*n - 2 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = a(2) = 1 and a(3) = 2.at n=18A049891
• Integers k such that omega(k) = omega(k-1) + omega(k-2) + omega(k-3), where omega(n) is the number of distinct prime factors of n.at n=23A076252
• A089450 indexed by A000040.at n=19A089525
• Numbers n such that |Fibonacci(n) - prime(n)| is prime.at n=17A099381
• Numbers n such that 5*10^n + 7*R_n - 6 is prime, where R_n = 11...1 is the repunit (A002275) of length n.at n=16A103019
• Transform of the finite sequence (1, 0, -1, 0, 1, 0, -1) by the T_{0,1} transform (see link).at n=12A159342
• Number of right triangles on a (n+1)X9 grid.at n=14A189813
• Number of partitions p of n such that ceiling(mean(p)) is a part and floor(mean(p)) is not.at n=50A241341
• Pisot sequence E(30,989), a(n) = floor(a(n-1)^2/a(n-2) + 1/2).at n=2A276396
• Triangle read by rows in which T(n,k) is the number of length k chains from (0,0) to (n,n) of the poset [n] X [n] ordered by the product order, 0 <= k <= 2n, n>=0.at n=62A316649
• Denominator of 2*Sum_{k=0..n} binomial(n,k)^2*binomial(n+k,k)^2*(H(n+k)-H(n-k)) where H(n) = Sum_{k=1..n} 1/k.at n=20A334887
• Number of equivalence classes of 4-binomial complexity for binary words of length n. Or, equivalently, the number of distinct 4-decks of binary words of length n.at n=14A335890
• a(n) is the least m such that A338266(m) = prime(n), where A338266(m) is the least prime p such that p*m is not a totient number.at n=39A338561
• Triangle read by rows: T(n,k) = A(k,n-k), 1 <= k < n, 2 <= n, where A(m,n) is the number of distinct strings consisting of one X, m+n-1 Y's and m+n-1 Z's in which the X lies to the right of at least m Y's and at least m Z's.at n=34A351585
• For n > 1, if n appears in the sequence, a(n) = a(n-1) - n if nonnegative and not already in the sequence, otherwise a(n) = a(n-1) + n. Otherwise a(n+1) = a(n)/(n+1) if (n+1)|a(n), otherwise a(n)*(n+1), a(1) = 1 and a(2) = 1*2.at n=14A362698