Sequences
392,541 sequences
- Partial sums of A081660.A081661
Partial sums of A081660.
- Partial sums of n + Fibonacci(n+1).A081662
Partial sums of n + Fibonacci(n+1).
- a(n) = Fibonacci(2n+1) + n*2^(n-1).A081663
a(n) = Fibonacci(2n+1) + n*2^(n-1).
- For the smallest q for which there exists a fraction p/q containing n in its decimal expansion, this sequence gives the smallest p.A081664
For the smallest q for which there exists a fraction p/q containing n in its decimal expansion, this sequence gives the smallest p.
- Smallest integer q for which there exists a fraction p/q containing n in its decimal expansion.A081665
Smallest integer q for which there exists a fraction p/q containing n in its decimal expansion.
- n*3^(n-1)+A081567(n).A081666
n*3^(n-1)+A081567(n).
- a(n) = Fibonacci(binomial(n+2,2)).A081667
a(n) = Fibonacci(binomial(n+2,2)).
- Expansion of 2sinh(x) + BesselI_0(2x).A081668
Expansion of 2sinh(x) + BesselI_0(2x).
- Expansion of exp(2x)+exp(x)BesselI_0(2x).A081669
Expansion of exp(2x)+exp(x)BesselI_0(2x).
- a(n) = 3^n-1+C(2n,n).A081670
a(n) = 3^n-1+C(2n,n).
- Expansion of e.g.f. exp(4x) * I_0(2x).A081671
Expansion of e.g.f. exp(4x) * I_0(2x).
- Expansion of exp(2x) - exp(0) + BesselI_0(2x).A081672
Expansion of exp(2x) - exp(0) + BesselI_0(2x).
- Expansion of exp(3*x) - exp(x)*(1-BesselI_0(2*x)).A081673
Expansion of exp(3*x) - exp(x)*(1-BesselI_0(2*x)).
- Generalized Poly-Bernoulli numbers.A081674
Generalized Poly-Bernoulli numbers.
- Generalized Poly-Bernoulli numbers.A081675
Generalized Poly-Bernoulli numbers.
- Largest perfect power <= n.A081676
Largest perfect power <= n.
- Numbers n such that 2*10^n + 3 is prime.A081677
Numbers n such that 2*10^n + 3 is prime.
- a(n) = (4*6^n - 3*5^n - 3^n)/6.A081678
a(n) = (4*6^n - 3*5^n - 3^n)/6.
- a(n) = (6^n - 5^n - 4^n - 3^n + 4*2^n)/2.A081679
a(n) = (6^n - 5^n - 4^n - 3^n + 4*2^n)/2.
- a(n) = (7^n - 6^n - 5^n - 4^n + 4*3^n)/2.A081680
a(n) = (7^n - 6^n - 5^n - 4^n + 4*3^n)/2.
- a(n) = (8^n - 7^n - 6^n - 5^n + 4*4^n)/2.A081681
a(n) = (8^n - 7^n - 6^n - 5^n + 4*4^n)/2.
- a(n) = (9^n - 8^n - 7^n - 6^n + 4*5^n)/2.A081682
a(n) = (9^n - 8^n - 7^n - 6^n + 4*5^n)/2.
- a(n) = (10^n - 9^n - 8^n - 7^n + 4*6^n)/2.A081683
a(n) = (10^n - 9^n - 8^n - 7^n + 4*6^n)/2.
- a(n) = 5^n - 4^n - 3^n - 2^n + 3.A081684
a(n) = 5^n - 4^n - 3^n - 2^n + 3.
- a(n) = 6^n - 5^n - 4^n - 3^n + 3*2^n.A081685
a(n) = 6^n - 5^n - 4^n - 3^n + 3*2^n.
- a(n) = 7^n - 6^n - 5^n - 4^n + 3*3^n.A081686
a(n) = 7^n - 6^n - 5^n - 4^n + 3*3^n.
- a(n) = 8^n - 7^n - 6^n - 5^n + 3*4^n.A081687
a(n) = 8^n - 7^n - 6^n - 5^n + 3*4^n.
- 0 followed by A030124 - 1.A081688
0 followed by A030124 - 1.
- A005228 - 1.A081689
A005228 - 1.
- From P-positions in a certain game.A081690
From P-positions in a certain game.
- From P-positions in a certain game.A081691
From P-positions in a certain game.
- Define two sequences by A_n = mex{A_i,B_i : 0 <= i < n}, B_n = B_{n-1} + (A_n-A_{n-1})(A_n-A_{n-1}+1), where the mex of a set is the smallest nonnegative integer not in the set. Sequence gives A_n. B_n is in A081693.A081692
Define two sequences by A_n = mex{A_i,B_i : 0 <= i < n}, B_n = B_{n-1} + (A_n-A_{n-1})(A_n-A_{n-1}+1), where the mex of a set is the smallest nonnegative integer not in the set. Sequence gives A_n. B_n is in A081693.
- Define two sequences by A_n = mex{A_i,B_i : 0 <= i < n}, B_n = B_{n-1} + (A_n-A_{n-1})(A_n-A_{n-1}+1), where the mex of a set is the smallest nonnegative integer not in the set. Sequence gives B_n. A_n is in A081692.A081693
Define two sequences by A_n = mex{A_i,B_i : 0 <= i < n}, B_n = B_{n-1} + (A_n-A_{n-1})(A_n-A_{n-1}+1), where the mex of a set is the smallest nonnegative integer not in the set. Sequence gives B_n. A_n is in A081692.
- From P-positions in a certain game.A081694
From P-positions in a certain game.
- From P-positions in a certain game.A081695
From P-positions in a certain game.
- Expansion of 1/(x + sqrt(1-4x)).A081696
Expansion of 1/(x + sqrt(1-4x)).
- 10-level labeled rooted trees with n leaves.A081697
10-level labeled rooted trees with n leaves.
- Expansion of (1 - sqrt( 1 - 4*x*sqrt( 1 + 4*x )) )/( 2*x ).A081698
Expansion of (1 - sqrt( 1 - 4*x*sqrt( 1 + 4*x )) )/( 2*x ).
- k-tuple abundance record-holders.A081699
k-tuple abundance record-holders.
- k-tuple abundance records.A081700
k-tuple abundance records.
- a(n) = prime(n) * (prime(n) - 1)^(prime(n) - 1).A081701
a(n) = prime(n) * (prime(n) - 1)^(prime(n) - 1).
- Largest prime factor of the n-th Carmichael number (A002997).A081702
Largest prime factor of the n-th Carmichael number (A002997).
- Largest proper divisor of the n-th Carmichael number (A002997).A081703
Largest proper divisor of the n-th Carmichael number (A002997).
- Let f(0)=1, f(1)=t, f(n+1) = (f(n)^2+t^n)/f(n-1). f(t) is a polynomial with integer coefficients. Then a(n) = f(n) when t=3.A081704
Let f(0)=1, f(1)=t, f(n+1) = (f(n)^2+t^n)/f(n-1). f(t) is a polynomial with integer coefficients. Then a(n) = f(n) when t=3.
- k-tuple abundance of abundant numbers.A081705
k-tuple abundance of abundant numbers.
- Numbers n such that binary representation ends either in an odd number of ones followed by one zero or in an even number of ones.A081706
Numbers n such that binary representation ends either in an odd number of ones followed by one zero or in an even number of ones.
- a(n) = tau(n) - bigomega(n) = A000005(n) - A001222(n).A081707
a(n) = tau(n) - bigomega(n) = A000005(n) - A001222(n).
- a(n) = a(n-1) + 64*a(n-2) starting with a(0) = 2 and a(1) = 1.A081708
a(n) = a(n-1) + 64*a(n-2) starting with a(0) = 2 and a(1) = 1.
- Decimal expansion of lim_{i->infinity} Product_{j=2..i} Gamma(j+zeta(j+1)) / Gamma(j+zeta(j)).A081709
Decimal expansion of lim_{i->infinity} Product_{j=2..i} Gamma(j+zeta(j+1)) / Gamma(j+zeta(j)).
- k! + k# + 1 is prime, where k# is the primorial function.A081710
k! + k# + 1 is prime, where k# is the primorial function.