Sequences
392,541 sequences
- Decimal expansion of sin(sin(sin(1))).A085661
Decimal expansion of sin(sin(sin(1))).
- Decimal expansion of sin(sin(1)).A085662
Decimal expansion of sin(sin(1)).
- Decimal expansion of cos(cos(1)).A085663
Decimal expansion of cos(cos(1)).
- Decimal expansion of cos(cos(cos(1))).A085664
Decimal expansion of cos(cos(cos(1))).
- Decimal expansion of tan(tan(1)).A085665
Decimal expansion of tan(tan(1)).
- Decimal expansion of -tan(tan(tan(1))).A085666
Decimal expansion of -tan(tan(tan(1))).
- Decimal expansion of e^e^e^e.A085667
Decimal expansion of e^e^e^e.
- Decimal expansion of log(1 + Pi).A085668
Decimal expansion of log(1 + Pi).
- Decimal expansion of log(1 + log(1 + Pi)).A085669
Decimal expansion of log(1 + log(1 + Pi)).
- Decimal expansion of log(1 + log(1 + log(1 + Pi))).A085670
Decimal expansion of log(1 + log(1 + log(1 + Pi))).
- Decimal expansion of log(1 + exp(1)).A085671
Decimal expansion of log(1 + exp(1)).
- Decimal expansion of log(1 + log(1 + exp(1))).A085672
Decimal expansion of log(1 + log(1 + exp(1))).
- Decimal expansion of log(1 + log(1 + log(1 + e))).A085673
Decimal expansion of log(1 + log(1 + log(1 + e))).
- Decimal expansion of log(1 + log(1 + log(1 + log(1 + e)))).A085674
Decimal expansion of log(1 + log(1 + log(1 + log(1 + e)))).
- Decimal expansion of log(1 + log(1 + log(1 + log(1 + Pi)))).A085675
Decimal expansion of log(1 + log(1 + log(1 + log(1 + Pi)))).
- Decimal expansion of -sin(10^50).A085676
Decimal expansion of -sin(10^50).
- Decimal expansion of -cos(10^50).A085677
Decimal expansion of -cos(10^50).
- Decimal expansion of e^1000.A085678
Decimal expansion of e^1000.
- Decimal expansion of arctan(10^50).A085679
Decimal expansion of arctan(10^50).
- Size of largest code of length n and constant weight 2 that can correct a single adjacent transposition.A085680
Size of largest code of length n and constant weight 2 that can correct a single adjacent transposition.
- Integers of the form 2^n*p where p is a prime > 2^n.A085681
Integers of the form 2^n*p where p is a prime > 2^n.
- Numbers k such that k^k - (k-1)^k is prime.A085682
Numbers k such that k^k - (k-1)^k is prime.
- a(n) = Sum_{k = 1..N-1} floor(N/k) where N is the n-th prime.A085683
a(n) = Sum_{k = 1..N-1} floor(N/k) where N is the n-th prime.
- Triangle read by rows: T(n,k), n >= 0, 0 <= k <= n, is size of maximal 1-transposition-correcting code formed using binary vectors of length n and weight k.A085684
Triangle read by rows: T(n,k), n >= 0, 0 <= k <= n, is size of maximal 1-transposition-correcting code formed using binary vectors of length n and weight k.
- Triangle read by rows: T(n,k), n >= 0, 0 <= k <= n, is size of maximal 1-transposition-correcting code formed using binary vectors of length n and weight k. The end-around transposition is allowed.A085685
Triangle read by rows: T(n,k), n >= 0, 0 <= k <= n, is size of maximal 1-transposition-correcting code formed using binary vectors of length n and weight k. The end-around transposition is allowed.
- Inverse Euler transform of Bell numbers.A085686
Inverse Euler transform of Bell numbers.
- Expansion of g.f. 8/(1+sqrt(1-8*x))^3.A085687
Expansion of g.f. 8/(1+sqrt(1-8*x))^3.
- a(1) = 11; a(n) = if n == 2 mod 3 then a(n-1)-3, if n == 0 mod 3 then a(n-1)-2, if n == 1 mod 3 then a(n-1)*2.A085688
a(1) = 11; a(n) = if n == 2 mod 3 then a(n-1)-3, if n == 0 mod 3 then a(n-1)-2, if n == 1 mod 3 then a(n-1)*2.
- a(1) = 4; a(n) = if n == 2 mod 3 then a(n-1)/2, if n == 0 mod 3 then a(n-1)*2, if n == 1 mod 3 then a(n-1)*3.A085689
a(1) = 4; a(n) = if n == 2 mod 3 then a(n-1)/2, if n == 0 mod 3 then a(n-1)*2, if n == 1 mod 3 then a(n-1)*3.
- Number of intersections between a sphere inscribed in a cube and the n X n X n cubes resulting from a cubic lattice subdivision of the enclosing cube.A085690
Number of intersections between a sphere inscribed in a cube and the n X n X n cubes resulting from a cubic lattice subdivision of the enclosing cube.
- Triangle read by rows: T(n,k) is the number of triangles of side k in triangular matchstick arrangement of side n; n>=1 and k>=1.A085691
Triangle read by rows: T(n,k) is the number of triangles of side k in triangular matchstick arrangement of side n; n>=1 and k>=1.
- Brocard's problem: squares which can be written as n!+1 for some n.A085692
Brocard's problem: squares which can be written as n!+1 for some n.
- Let f(0) = 1, f(1) = 12, f(2) = 223, f(3) = 3334, = f(4) = 44445, f(5) = 555556, etc. Sequence gives concatenation of 0, f(0), f(f(0)), f(f(f(0))), ...A085693
Let f(0) = 1, f(1) = 12, f(2) = 223, f(3) = 3334, = f(4) = 44445, f(5) = 555556, etc. Sequence gives concatenation of 0, f(0), f(f(0)), f(f(f(0))), ...
- Let f(0) = 1, f(1) = 12, f(2) = 223, f(3) = 3334, f(4) = 44445, f(5) = 555556, etc. Sequence gives limiting value of f(0), f(f(0)), f(f(f(0))), ...A085694
Let f(0) = 1, f(1) = 12, f(2) = 223, f(3) = 3334, f(4) = 44445, f(5) = 555556, etc. Sequence gives limiting value of f(0), f(f(0)), f(f(f(0))), ...
- a(n) = Fibonacci(n)*Fibonacci(3n)/2.A085695
a(n) = Fibonacci(n)*Fibonacci(3n)/2.
- a(n) = L(n) * L(n+1) * L(n+2) / 2, where L(n) = Lucas number (A000032).A085696
a(n) = L(n) * L(n+1) * L(n+2) / 2, where L(n) = Lucas number (A000032).
- a(n) = T(n)^2, where T(n) = A000073(n) is the n-th tribonacci number.A085697
a(n) = T(n)^2, where T(n) = A000073(n) is the n-th tribonacci number.
- Row sums of A087074.A085698
Row sums of A087074.
- Smallest multiple of n such that a(n) + a(n-1) is an n-th power.A085699
Smallest multiple of n such that a(n) + a(n-1) is an n-th power.
- Numbers k such that (2k)! - (2k-2)! + (2k-4)! - ... + (-1)^k 0! is prime.A085700
Numbers k such that (2k)! - (2k-2)! + (2k-4)! - ... + (-1)^k 0! is prime.
- Smallest multiple of n such that a(n) + a(n-1) is a squarefree number.A085701
Smallest multiple of n such that a(n) + a(n-1) is a squarefree number.
- Numbers k such that the sum of primes dividing k (with repetition) / smallest prime dividing k = largest prime dividing k.A085702
Numbers k such that the sum of primes dividing k (with repetition) / smallest prime dividing k = largest prime dividing k.
- a(1)=4, then least semiprime > a(n-1) such that when all in the sequence are concatenated together they form a prime.A085703
a(1)=4, then least semiprime > a(n-1) such that when all in the sequence are concatenated together they form a prime.
- Primes of the form prime(k)*2 - prime(k-1), k>1.A085704
Primes of the form prime(k)*2 - prime(k-1), k>1.
- Integers expressible as (x^3 + y^3 + z^3)/(x*y*z) with nonzero integers x, y and z. Alternatively, integers expressible as a/b + b/c + c/a with nonzero integers a, b and c.A085705
Integers expressible as (x^3 + y^3 + z^3)/(x*y*z) with nonzero integers x, y and z. Alternatively, integers expressible as a/b + b/c + c/a with nonzero integers a, b and c.
- Squarefree numbers sandwiched between two brilliant numbers.A085706
Squarefree numbers sandwiched between two brilliant numbers.
- Triangular array A065547 unsigned and transposed.A085707
Triangular array A065547 unsigned and transposed.
- Arithmetic derivative of 10^n.A085708
Arithmetic derivative of 10^n.
- a(0)=1; then smallest multiple of n such that a(n) + a(n-1) is a semiprime.A085709
a(0)=1; then smallest multiple of n such that a(n) + a(n-1) is a semiprime.
- Smallest k such that kn+1 is a semiprime.A085710
Smallest k such that kn+1 is a semiprime.