Sequences
392,541 sequences
- G.f.: 1/(1-x) * Sum_{k>=0} x^2^(k+2)/(1+x^2^k).A083661
G.f.: 1/(1-x) * Sum_{k>=0} x^2^(k+2)/(1+x^2^k).
- a(n) = a(floor(n/2)) + a(floor(n/4)), n > 0; a(0)=1.A083662
a(n) = a(floor(n/2)) + a(floor(n/4)), n > 0; a(0)=1.
- Least k such that k*n!-1 is prime.A083663
Least k such that k*n!-1 is prime.
- a(1) = 1, a(n) = if n mod 10 = 0 then n else smallest number m, not occurring earlier such that m*a(n-d) is a palindrome, where d = if n mod 10 = 1 then 2 else 1.A083664
a(1) = 1, a(n) = if n mod 10 = 0 then n else smallest number m, not occurring earlier such that m*a(n-d) is a palindrome, where d = if n mod 10 = 1 then 2 else 1.
- Inverse of A083664.A083665
Inverse of A083664.
- Palindromes arising when building A083664.A083666
Palindromes arising when building A083664.
- Number of antisymmetric binary relations on a set of n labeled points.A083667
Number of antisymmetric binary relations on a set of n labeled points.
- Prime indices of prime Fibonacci numbers.A083668
Prime indices of prime Fibonacci numbers.
- Number of ordered quintuples (a,b,c,d,e), -n <= a,b,c,d,e <= n, such that a+b+c+d+e = 0.A083669
Number of ordered quintuples (a,b,c,d,e), -n <= a,b,c,d,e <= n, such that a+b+c+d+e = 0.
- Number of different antisymmetric relations on n unlabeled points.A083670
Number of different antisymmetric relations on n unlabeled points.
- Array read by rows in which each row describes in words the composition of the previous row.A083671
Array read by rows in which each row describes in words the composition of the previous row.
- Binomial transform of 1,8,48,256,1280,6144,... (cf. A002697).A083672
Binomial transform of 1,8,48,256,1280,6144,... (cf. A002697).
- First differences have period 6: 2,-1,3,4,-3,7, 2,-1,3,4,-3,7, 2,-1,...A083673
First differences have period 6: 2,-1,3,4,-3,7, 2,-1,3,4,-3,7, 2,-1,...
- Triangular numbers whose sum of divisors is also a triangular number.A083674
Triangular numbers whose sum of divisors is also a triangular number.
- Triangular numbers whose sum of aliquot divisors is also a triangular number.A083675
Triangular numbers whose sum of aliquot divisors is also a triangular number.
- Triangular numbers whose sum of aliquot divisors is a prime number.A083676
Triangular numbers whose sum of aliquot divisors is a prime number.
- Define f(n, k) to be the concatenation of the first n primes, with n-1 k's inserted between the primes. Then a(n) is the smallest k >= 0 such that f(n, k) is prime, or -1 if no such prime exists.A083677
Define f(n, k) to be the concatenation of the first n primes, with n-1 k's inserted between the primes. Then a(n) is the smallest k >= 0 such that f(n, k) is prime, or -1 if no such prime exists.
- Numbers m = d_1 d_2 ... d_k (in base 10) with properties that k is even and d_i + d_{k+1-i} = 10 for all i.A083678
Numbers m = d_1 d_2 ... d_k (in base 10) with properties that k is even and d_i + d_{k+1-i} = 10 for all i.
- Decimal expansion of log(4/3).A083679
Decimal expansion of log(4/3).
- Decimal expansion of (3/2)*log(3/2).A083680
Decimal expansion of (3/2)*log(3/2).
- Sum of divisors of semiprimes.A083681
Sum of divisors of semiprimes.
- Sum of aliquot divisors of semiprimes.A083682
Sum of aliquot divisors of semiprimes.
- a(n) = 11*2^n + 1.A083683
a(n) = 11*2^n + 1.
- Numbers k such that there is no nonnegative integer m such that m < k*prime(k) and the concatenated decimal number fp(k,m) = prime(1).m.prime(2).m. ... .prime(k-1).m.prime(k) is prime.A083684
Numbers k such that there is no nonnegative integer m such that m < k*prime(k) and the concatenated decimal number fp(k,m) = prime(1).m.prime(2).m. ... .prime(k-1).m.prime(k) is prime.
- a(n) is the smallest prime of the form k*lcm(1..n) - 1.A083685
a(n) is the smallest prime of the form k*lcm(1..n) - 1.
- a(0) = 8; for n>0, a(n) = 2*a(n-1) - 1.A083686
a(0) = 8; for n>0, a(n) = 2*a(n-1) - 1.
- Numerator of B(2n)*H(2n)/n*(-1)^(n+1) where B(k) is the k-th Bernoulli number and H(k) the k-th harmonic number.A083687
Numerator of B(2n)*H(2n)/n*(-1)^(n+1) where B(k) is the k-th Bernoulli number and H(k) the k-th harmonic number.
- Denominator of B(2n)*H(2n)/n where B(k) is the k-th Bernoulli number and H(k) the k-th harmonic number.A083688
Denominator of B(2n)*H(2n)/n where B(k) is the k-th Bernoulli number and H(k) the k-th harmonic number.
- Numbers n such that the sum of the factorials of the digits of n! is prime.A083689
Numbers n such that the sum of the factorials of the digits of n! is prime.
- a(n) = number of partitions of n wherein the sum of the 1's is no more than the sum of the other parts.A083690
a(n) = number of partitions of n wherein the sum of the 1's is no more than the sum of the other parts.
- Length of list generated by n replacements of k by {-1-|k|, ..., 1+|k|} with increment 2, starting with {0}.A083691
Length of list generated by n replacements of k by {-1-|k|, ..., 1+|k|} with increment 2, starting with {0}.
- Length of list generated by n replacements of k by {-1-|k|, .., 1+|k|} with increment 2, starting with {1}.A083692
Length of list generated by n replacements of k by {-1-|k|, .., 1+|k|} with increment 2, starting with {1}.
- Sum of absolute values of list generated by n replacements of k by {-1-|k|, .., 1+|k|} with increment 2, starting with {1}.A083693
Sum of absolute values of list generated by n replacements of k by {-1-|k|, .., 1+|k|} with increment 2, starting with {1}.
- a(n) = 2*A002532(n).A083694
a(n) = 2*A002532(n).
- a(n) = 2*a(n-1) + 5*a(n-2), with a(0) = 0, a(1) = 3.A083695
a(n) = 2*a(n-1) + 5*a(n-2), with a(0) = 0, a(1) = 3.
- a(n) = Sum_{r=0..2^(n-1)} (5^r/(2r)!)*Product_{k=0..2r-1} (2^n - k).A083696
a(n) = Sum_{r=0..2^(n-1)} (5^r/(2r)!)*Product_{k=0..2r-1} (2^n - k).
- a(n) = 2^(2^n - 1) * Fibonacci(2^n).A083697
a(n) = 2^(2^n - 1) * Fibonacci(2^n).
- Partial quotients of the continued fraction which has convergents with the least possible prime denominators (A072999).A083698
Partial quotients of the continued fraction which has convergents with the least possible prime denominators (A072999).
- Numerators of the continued fraction convergents which have the least possible prime denominators (A072999).A083699
Numerators of the continued fraction convergents which have the least possible prime denominators (A072999).
- Decimal expansion of the limit of the n-th continued fraction convergent, A083699(n)/A072999(n), which has the least prime denominator.A083700
Decimal expansion of the limit of the n-th continued fraction convergent, A083699(n)/A072999(n), which has the least prime denominator.
- Smallest prime having Fibonacci(n) as least primitive root, or 0 if no such prime exists.A083701
Smallest prime having Fibonacci(n) as least primitive root, or 0 if no such prime exists.
- Smallest number having Fibonacci(n) as least primitive root, or 0 if no such number exists.A083702
Smallest number having Fibonacci(n) as least primitive root, or 0 if no such number exists.
- Expansion of eta(q)^4/eta(q^4) in powers of q.A083703
Expansion of eta(q)^4/eta(q^4) in powers of q.
- a(n)=sum(k=1,n,floor(r*floor(k/r))) where r=sqrt(3).A083704
a(n)=sum(k=1,n,floor(r*floor(k/r))) where r=sqrt(3).
- a(n) = 2*a(n-1) - 1 with a(0) = 10.A083705
a(n) = 2*a(n-1) - 1 with a(0) = 10.
- a(n) = 2^(n+1) + n - 1.A083706
a(n) = 2^(n+1) + n - 1.
- G.f.: (x+4*x^3+x^5)/((1-x)^2*(1-x^2)^2*(1-x^3)).A083707
G.f.: (x+4*x^3+x^5)/((1-x)^2*(1-x^2)^2*(1-x^3)).
- G.f.: (x+4*x^3+x^5)/((1-x)^2*(1-x^2)^2*(1-x^3)^2).A083708
G.f.: (x+4*x^3+x^5)/((1-x)^2*(1-x^2)^2*(1-x^3)^2).
- G.f.: (1-x+2*x^2+2*x^3+2*x^4-x^5+x^6)/((1-x)*(1-x^2)^2*(1-x^3)).A083709
G.f.: (1-x+2*x^2+2*x^3+2*x^4-x^5+x^6)/((1-x)*(1-x^2)^2*(1-x^3)).
- Number of integer partitions of n with a part dividing all the other parts.A083710
Number of integer partitions of n with a part dividing all the other parts.