Sequences
392,541 sequences
- Define C(n) by the recursion C(0) = 4*i where i^2 = -1, C(n+1) = 1/(1 + C(n)), then a(n) = 4*(-1)^n/Im(C(n)) where Im(z) denotes the imaginary part of z.A069961
Define C(n) by the recursion C(0) = 4*i where i^2 = -1, C(n+1) = 1/(1 + C(n)), then a(n) = 4*(-1)^n/Im(C(n)) where Im(z) denotes the imaginary part of z.
- Define C(n) by the recursion C(0) = 5*i where i^2 = -1, C(n+1) = 1/(1 + C(n)), then a(n) = 5*(-1)^n/Im(C(n)) where Im(z) denotes the imaginary part of z.A069962
Define C(n) by the recursion C(0) = 5*i where i^2 = -1, C(n+1) = 1/(1 + C(n)), then a(n) = 5*(-1)^n/Im(C(n)) where Im(z) denotes the imaginary part of z.
- Define C(n) by the recursion C(0) = 6*i where i^2 = -1, C(n+1) = 1/(1 + C(n)), then a(n) = 6*(-1)^n/Im(C(n)) where Im(z) denotes the imaginary part of z.A069963
Define C(n) by the recursion C(0) = 6*i where i^2 = -1, C(n+1) = 1/(1 + C(n)), then a(n) = 6*(-1)^n/Im(C(n)) where Im(z) denotes the imaginary part of z.
- a(n) = (sum of digits of n)^4 - (sum of digits^4 of n).A069964
a(n) = (sum of digits of n)^4 - (sum of digits^4 of n).
- (Sum of digits of n)^5 - (sum of digits^5 of n).A069965
(Sum of digits of n)^5 - (sum of digits^5 of n).
- (Sum of digits of n)^6 - (sum of digits^6 of n).A069966
(Sum of digits of n)^6 - (sum of digits^6 of n).
- Duplicate of A061909.A069967
Duplicate of A061909.
- Duplicate of A056240.A069968
Duplicate of A056240.
- Numbers n such that phi(reverse(n)) = phi(reverse(n-1)) + phi(reverse(n-2)).A069969
Numbers n such that phi(reverse(n)) = phi(reverse(n-1)) + phi(reverse(n-2)).
- Numbers k such that sigma(reverse(k)) = sigma(reverse(k-1)) + sigma(reverse(k-2)).A069970
Numbers k such that sigma(reverse(k)) = sigma(reverse(k-1)) + sigma(reverse(k-2)).
- Table by antidiagonals of variance of time for a random walk starting at 0 to reach one of the boundaries at +n or -k for the first time.A069971
Table by antidiagonals of variance of time for a random walk starting at 0 to reach one of the boundaries at +n or -k for the first time.
- a(n) = Sum_{d|2*n,d+1|2*n} d.A069972
a(n) = Sum_{d|2*n,d+1|2*n} d.
- (Sum of digits of n)^3 - (sum of digits of n^3).A069973
(Sum of digits of n)^3 - (sum of digits of n^3).
- Duplicate of A039650.A069974
Duplicate of A039650.
- a(n) = n*(16*n^2 - 1).A069975
a(n) = n*(16*n^2 - 1).
- Interior angle of a regular polygon of n sides, rounded to nearest integer.A069976
Interior angle of a regular polygon of n sides, rounded to nearest integer.
- Numbers k such that k and k+2 are squarefree.A069977
Numbers k such that k and k+2 are squarefree.
- (Sum of digits of n)^4 - (sum of digits of n^4).A069978
(Sum of digits of n)^4 - (sum of digits of n^4).
- (Sum of digits of n)^5 - (sum of digits of n^5).A069979
(Sum of digits of n)^5 - (sum of digits of n^5).
- (Sum of digits of n)^6 - (sum of digits of n^6).A069980
(Sum of digits of n)^6 - (sum of digits of n^6).
- Hermite's problem: number of positive integral solutions to x + y + z = n subject to x <= y + z, y <= z + x and z <= x + y.A069981
Hermite's problem: number of positive integral solutions to x + y + z = n subject to x <= y + z, y <= z + x and z <= x + y.
- Number of 4-gonal compositions of n into positive parts.A069982
Number of 4-gonal compositions of n into positive parts.
- Number of 5-gonal compositions of n into positive parts.A069983
Number of 5-gonal compositions of n into positive parts.
- a(n) = 1123 + 21460*n.A069984
a(n) = 1123 + 21460*n.
- Numerator of b(n) = binomial(2n,n)^3*(42n+5)/2^(12n+4).A069985
Numerator of b(n) = binomial(2n,n)^3*(42n+5)/2^(12n+4).
- Denominator of b(n) = binomial(2n,n)^3*(42n+5)/2^(12n+4).A069986
Denominator of b(n) = binomial(2n,n)^3*(42n+5)/2^(12n+4).
- Squarefree numbers of form k^2 + 1.A069987
Squarefree numbers of form k^2 + 1.
- (-1)^(n+1)/6*sum(k=1,2n+1,C(2n+1,k)*B(k)*3^k) where C(n,k) are the binomial coefficients, B(k) the Bernoulli numbers.A069988
(-1)^(n+1)/6*sum(k=1,2n+1,C(2n+1,k)*B(k)*3^k) where C(n,k) are the binomial coefficients, B(k) the Bernoulli numbers.
- (-1)^(n+1)/2*sum(k=1,2n,C(2n+1,k)*B(k)*4^k) where C(n,k) are the binomial coefficients, B(k) the Bernoulli numbers.A069989
(-1)^(n+1)/2*sum(k=1,2n,C(2n+1,k)*B(k)*4^k) where C(n,k) are the binomial coefficients, B(k) the Bernoulli numbers.
- a(n) = (-1)^(n+1)/5 * Sum_{k=1..2n} binomial(2n+1,k)*B(k)*5^k where B(k) are the Bernoulli numbers.A069990
a(n) = (-1)^(n+1)/5 * Sum_{k=1..2n} binomial(2n+1,k)*B(k)*5^k where B(k) are the Bernoulli numbers.
- (-1)^(n+1)/14*sum(k=1,2n,C(2n+1,k)*B(k)*7^k) where C(n,k) are the binomial coefficients, B(k) the Bernoulli numbers.A069991
(-1)^(n+1)/14*sum(k=1,2n,C(2n+1,k)*B(k)*7^k) where C(n,k) are the binomial coefficients, B(k) the Bernoulli numbers.
- (-1)^(n+1)/3*sum(k=1,2n,C(2n+1,k)*B(k)*6^k) where C(n,k) are the binomial coefficients, B(k) the Bernoulli numbers.A069992
(-1)^(n+1)/3*sum(k=1,2n,C(2n+1,k)*B(k)*6^k) where C(n,k) are the binomial coefficients, B(k) the Bernoulli numbers.
- a(n) = 2^(2*n+1)*Sum_{k=1..2*n} binomial(2*n+1,k)*Bernoulli(k)/2^k.A069993
a(n) = 2^(2*n+1)*Sum_{k=1..2*n} binomial(2*n+1,k)*Bernoulli(k)/2^k.
- a(n) = Sum_{i=0..2n} B(i)*C(2n+1,i)*6^i where B(i) are the Bernoulli numbers, C(2n,i) the binomial coefficients.A069994
a(n) = Sum_{i=0..2n} B(i)*C(2n+1,i)*6^i where B(i) are the Bernoulli numbers, C(2n,i) the binomial coefficients.
- Decimal expansion of the real positive solution to zeta(x)=x.A069995
Decimal expansion of the real positive solution to zeta(x)=x.
- Number of spanning trees on the bipartite graph K_{3,n}.A069996
Number of spanning trees on the bipartite graph K_{3,n}.
- Decimal expansion of (negative of) root of exp(x)+sin(x)=0.A069997
Decimal expansion of (negative of) root of exp(x)+sin(x)=0.
- Decimal expansion of sqrt(Pi/2).A069998
Decimal expansion of sqrt(Pi/2).
- Number of possible dimensions for commutators of n X n matrices; it is independent of the field. Or, given a partition P = (p_1, p_2, ..., p_m) of n with p_1 >= p_2 >= ... >= p_m, let S(P) = sum_j (2j-1)p_j; then a(n) = number of integers that are an S(P) for some partition.A069999
Number of possible dimensions for commutators of n X n matrices; it is independent of the field. Or, given a partition P = (p_1, p_2, ..., p_m) of n with p_1 >= p_2 >= ... >= p_m, let S(P) = sum_j (2j-1)p_j; then a(n) = number of integers that are an S(P) for some partition.
- Let B(n) denote the number of distinct norms <=n in the square lattice and let B_3(n) denote the number of distinct norms <=n in the hexagonal lattice; sequence gives B(n) - B3(n).A070000
Let B(n) denote the number of distinct norms <=n in the square lattice and let B_3(n) denote the number of distinct norms <=n in the hexagonal lattice; sequence gives B(n) - B3(n).
- Palindromic integers > 0, whose 'Reverse and Add!' trajectory (presumably) does not lead to another palindrome.A070001
Palindromic integers > 0, whose 'Reverse and Add!' trajectory (presumably) does not lead to another palindrome.
- Numbers k such that phi(P(k)) - P(phi(k)) = 1, where P(k) is the largest prime factor of k.A070002
Numbers k such that phi(P(k)) - P(phi(k)) = 1, where P(k) is the largest prime factor of k.
- Numbers divisible by the square of their largest prime factor.A070003
Numbers divisible by the square of their largest prime factor.
- Numbers of the form 5*2^n or 5*3*2^n; a(n) = 5*A029744(n).A070004
Numbers of the form 5*2^n or 5*3*2^n; a(n) = 5*A029744(n).
- Arithmetic mean of prime factors of n is an integer and n is neither a prime nor power of a prime.A070005
Arithmetic mean of prime factors of n is an integer and n is neither a prime nor power of a prime.
- Composite numbers that are not a prime power and whose distinct prime divisors' arithmetic mean is a prime.A070006
Composite numbers that are not a prime power and whose distinct prime divisors' arithmetic mean is a prime.
- Arithmetic mean of distinct primes dividing n is a square number.A070007
Arithmetic mean of distinct primes dividing n is a square number.
- Arithmetic mean of distinct primes dividing n is a power of 2 (powers of 2 are not left out).A070008
Arithmetic mean of distinct primes dividing n is a power of 2 (powers of 2 are not left out).
- Least number m such that the arithmetic mean of the distinct prime divisors of m is equal to 2^n.A070009
Least number m such that the arithmetic mean of the distinct prime divisors of m is equal to 2^n.
- GCD of consecutive values of sum-of-proper divisors.A070010
GCD of consecutive values of sum-of-proper divisors.