Sequences
392,541 sequences
- Number of numbers <= n having no 2 in their ternary representation.A081611
Number of numbers <= n having no 2 in their ternary representation.
- First column of A082827.A081612
First column of A082827.
- Length of iteration list when Collatz-function is iterated with initial value n!.A081613
Length of iteration list when Collatz-function is iterated with initial value n!.
- Subsequence of A005428 with state = 1.A081614
Subsequence of A005428 with state = 1.
- Subsequence of A005428 where state = 2.A081615
Subsequence of A005428 where state = 2.
- Sequence of constants appearing in formula for expected number of inversions after a sequence of random adjacent transpositions.A081616
Sequence of constants appearing in formula for expected number of inversions after a sequence of random adjacent transpositions.
- Smallest k such that (product of first n primes)*k+1 is divisible by the (n+1)-th prime. Also (A075306(n)-1)/A002110(n).A081617
Smallest k such that (product of first n primes)*k+1 is divisible by the (n+1)-th prime. Also (A075306(n)-1)/A002110(n).
- Numbers n such that (product of first n primes)+1 is divisible by the (n+1)-th prime. Also n such that A075306(n)-1 is equal to A002110(n). Positions of 1 in A081617.A081618
Numbers n such that (product of first n primes)+1 is divisible by the (n+1)-th prime. Also n such that A075306(n)-1 is equal to A002110(n). Positions of 1 in A081617.
- Numbers whose divisors can be arranged as equilateral triangle.A081619
Numbers whose divisors can be arranged as equilateral triangle.
- Least m with n*(n+1)/2 divisors.A081620
Least m with n*(n+1)/2 divisors.
- Number of n-node triangulations of the sphere with minimal degree 5.A081621
Number of n-node triangulations of the sphere with minimal degree 5.
- Number of 6-core partitions of n.A081622
Number of 6-core partitions of n.
- Number of ways in which the points on an n X n square lattice can be equally occupied with spin "up" and spin "down" particles. If n is odd, we arbitrarily take the lattice to contain one more spin "up" particle than the number of spin "down" particles.A081623
Number of ways in which the points on an n X n square lattice can be equally occupied with spin "up" and spin "down" particles. If n is odd, we arbitrarily take the lattice to contain one more spin "up" particle than the number of spin "down" particles.
- Number of 8-level labeled rooted trees with n leaves.A081624
Number of 8-level labeled rooted trees with n leaves.
- a(n) = 2*5^n - 3^n.A081625
a(n) = 2*5^n - 3^n.
- a(n) = 2*6^n-4^n.A081626
a(n) = 2*6^n-4^n.
- a(n) = 2*7^n-5^n.A081627
a(n) = 2*7^n-5^n.
- a(n) = 2*(-1)^n - (-5)^n.A081628
a(n) = 2*(-1)^n - (-5)^n.
- Number of 9-level labeled rooted trees with n leaves.A081629
Number of 9-level labeled rooted trees with n leaves.
- a(n) = 2-(-3)^n.A081630
a(n) = 2-(-3)^n.
- a(n) = 2*2^n - (-2)^n.A081631
a(n) = 2*2^n - (-2)^n.
- 2*3^n-(-1)^n.A081632
2*3^n-(-1)^n.
- Class 5+ primes (for definition see A005105).A081633
Class 5+ primes (for definition see A005105).
- Class 6+ primes.A081634
Class 6+ primes.
- Class 7+ primes.A081635
Class 7+ primes.
- Class 8+ primes.A081636
Class 8+ primes.
- Class 9+ primes.A081637
Class 9+ primes.
- Class 10+ primes.A081638
Class 10+ primes.
- Class 11+ primes.A081639
Class 11+ primes.
- a(n) = n-th prime of class 12- according to the Erdős-Selfridge classification.A081640
a(n) = n-th prime of class 12- according to the Erdős-Selfridge classification.
- a(n) = n-th prime of class 13- according to the Erdős-Selfridge classification.A081641
a(n) = n-th prime of class 13- according to the Erdős-Selfridge classification.
- Integers congruent to 0, 1 or 4 (mod 9) which are not squares.A081642
Integers congruent to 0, 1 or 4 (mod 9) which are not squares.
- Integers congruent to 0, 1, 4 or 9 (mod 16) which are not squares.A081643
Integers congruent to 0, 1, 4 or 9 (mod 16) which are not squares.
- Integers congruent to 0, 1, 4, 9 or 16 (mod 25) which are not squares.A081644
Integers congruent to 0, 1, 4, 9 or 16 (mod 25) which are not squares.
- Integers congruent to 0, 1, 4, 9, 16 or 25 (mod 36) which are not squares.A081645
Integers congruent to 0, 1, 4, 9, 16 or 25 (mod 36) which are not squares.
- Integers congruent to 0, 1, 4, 9, 16, 25 or 36 (mod 49) which are not squares.A081646
Integers congruent to 0, 1, 4, 9, 16, 25 or 36 (mod 49) which are not squares.
- Integers congruent to 0, 1, 4, 9, 16, 25, 36 or 49 (mod 64) which are not squares.A081647
Integers congruent to 0, 1, 4, 9, 16, 25, 36 or 49 (mod 64) which are not squares.
- Integers congruent to 0, 1, 4, 9, 16, 25, 36, 49 or 64 (mod 81) which are not squares.A081648
Integers congruent to 0, 1, 4, 9, 16, 25, 36, 49 or 64 (mod 81) which are not squares.
- Integers congruent to 0, 1, 4, 9, 16, 25, 36, 49, 64 or 81 (mod 100) which are not squares.A081649
Integers congruent to 0, 1, 4, 9, 16, 25, 36, 49, 64 or 81 (mod 100) which are not squares.
- Least nonsquare whose remainder modulo k^2 is a square for all 0 < k <= n.A081650
Least nonsquare whose remainder modulo k^2 is a square for all 0 < k <= n.
- a(n) = floor((3/2)^^n), where x^^n is the power tower x^(x^(...^x)) with n x's.A081651
a(n) = floor((3/2)^^n), where x^^n is the power tower x^(x^(...^x)) with n x's.
- Greatest common divisor of n and sum of decimal digits of n-th prime.A081652
Greatest common divisor of n and sum of decimal digits of n-th prime.
- Greatest common divisor of sums of decimal digits of n and of n-th prime.A081653
Greatest common divisor of sums of decimal digits of n and of n-th prime.
- a(n) = 2*4^n - 0^n.A081654
a(n) = 2*4^n - 0^n.
- a(n) = 2*5^n-1.A081655
a(n) = 2*5^n-1.
- a(n) = 2*6^n - 2^n.A081656
a(n) = 2*6^n - 2^n.
- a(n) = 2*7^n-3^n.A081657
a(n) = 2*7^n-3^n.
- Triangle read by rows: T(n, k) = (-2)^k*binomial(n, k)*Euler(k, 1/2).A081658
Triangle read by rows: T(n, k) = (-2)^k*binomial(n, k)*Euler(k, 1/2).
- a(n) = n + Fibonacci(n+1).A081659
a(n) = n + Fibonacci(n+1).
- n+A001045(n+1).A081660
n+A001045(n+1).