Sequences
392,541 sequences
- a(n) = 15*n^2.A064761
a(n) = 15*n^2.
- a(n) = 21*n^2.A064762
a(n) = 21*n^2.
- a(n) = 28*n^2.A064763
a(n) = 28*n^2.
- Largest integer m such that every permutation (p_1, ..., p_n) of (1, ..., n) satisfies lcm(p_i, p_{i+1}) >= m for some i, 1 <= i <= n-1.A064764
Largest integer m such that every permutation (p_1, ..., p_n) of (1, ..., n) satisfies lcm(p_i, p_{i+1}) >= m for some i, 1 <= i <= n-1.
- a(n) is the smallest number such that for, all m<n, both a(n)*a(m) and a(n)+a(m) are nonsquares.A064765
a(n) is the smallest number such that for, all m<n, both a(n)*a(m) and a(n)+a(m) are nonsquares.
- Fill up an infinite triangular array by rows by successively writing numbers 1, then 1 up to 2*3/2, then 1 up to 3*4/2, then 1 up to 4*5/2 and so on, at the k-th step writing the numbers from 1 up to the k-th triangular number. The final elements of the rows of this infinite triangle form the sequence.A064766
Fill up an infinite triangular array by rows by successively writing numbers 1, then 1 up to 2*3/2, then 1 up to 3*4/2, then 1 up to 4*5/2 and so on, at the k-th step writing the numbers from 1 up to the k-th triangular number. The final elements of the rows of this infinite triangle form the sequence.
- Order of automorphism group of the group C_n X C_n X C_n (where C_n is the cyclic group of order n).A064767
Order of automorphism group of the group C_n X C_n X C_n (where C_n is the cyclic group of order n).
- Sum of primes dividing the repunit numbers with a prime number of digits [A031974] (with repetition).A064768
Sum of primes dividing the repunit numbers with a prime number of digits [A031974] (with repetition).
- Numbers k such that (k!)^2 + prime(k) is prime.A064769
Numbers k such that (k!)^2 + prime(k) is prime.
- Replace each digit of n with the floor of its square root.A064770
Replace each digit of n with the floor of its square root.
- Let S(n) = set of divisors of n, excluding n; sequence gives n such that there is a unique subset of S(n) that sums to n.A064771
Let S(n) = set of divisors of n, excluding n; sequence gives n such that there is a unique subset of S(n) that sums to n.
- Sum of primes dividing n^n+1 (with repetition).A064772
Sum of primes dividing n^n+1 (with repetition).
- Numbers k such that k^k + p(k) is prime.A064773
Numbers k such that k^k + p(k) is prime.
- Primes of the form n^n + p(n).A064774
Primes of the form n^n + p(n).
- Number of positive integers k <= n such that all prime divisors of k are <= sqrt(k).A064775
Number of positive integers k <= n such that all prime divisors of k are <= sqrt(k).
- a(n) is smallest number >= a(n-1) such that a(n) plus any set of the previous values of the sequence is a nonsquare; starting with a(1) = 2.A064776
a(n) is smallest number >= a(n-1) such that a(n) plus any set of the previous values of the sequence is a nonsquare; starting with a(1) = 2.
- Numbers k such that prime(k) - pi(k) is divisible by k.A064777
Numbers k such that prime(k) - pi(k) is divisible by k.
- Largest m such that 1..m all divide n!.A064778
Largest m such that 1..m all divide n!.
- Primes such that the sum of their digits and the sum of the reciprocals of their digits is also prime.A064779
Primes such that the sum of their digits and the sum of the reciprocals of their digits is also prime.
- Number of times n occurs in A000195.A064780
Number of times n occurs in A000195.
- Number of partially labeled rooted trees with n nodes (5 of which are labeled).A064781
Number of partially labeled rooted trees with n nodes (5 of which are labeled).
- Number of partially labeled rooted trees with n nodes (6 of which are labeled).A064782
Number of partially labeled rooted trees with n nodes (6 of which are labeled).
- Least prime signature numbers that are not a Jordan-Polya number.A064783
Least prime signature numbers that are not a Jordan-Polya number.
- Difference between n-th triangular number t(n) and the largest square <= t(n).A064784
Difference between n-th triangular number t(n) and the largest square <= t(n).
- Number of partially labeled trees with n nodes (6 of which are labeled).A064785
Number of partially labeled trees with n nodes (6 of which are labeled).
- Inverse permutation to A054084.A064786
Inverse permutation to A054084.
- Inverse permutation to A053212.A064787
Inverse permutation to A053212.
- Inverse permutation to A060736.A064788
Inverse permutation to A060736.
- Inverse permutation to A057028.A064789
Inverse permutation to A057028.
- Inverse permutation to A060734.A064790
Inverse permutation to A060734.
- "Inverse permutation" to A064537. Limits of the recursion b(i+1)=B_[i](b(i)), where b(0)=n and B_[k](j) = B_[k-1](j) + k, k+1 <= j <= 2k; B_[k](j) = B_[k-1](j) - k, 2k+1 <= j <= 3k; B_[k](j) = B_[k-1](j) otherwise. Set a(n)=0 if b tends to infinity.A064791
"Inverse permutation" to A064537. Limits of the recursion b(i+1)=B_[i](b(i)), where b(0)=n and B_[k](j) = B_[k-1](j) + k, k+1 <= j <= 2k; B_[k](j) = B_[k-1](j) - k, 2k+1 <= j <= 3k; B_[k](j) = B_[k-1](j) otherwise. Set a(n)=0 if b tends to infinity.
- Append more digits to the n-th prime (leading zeros are permitted) until another prime is reached.A064792
Append more digits to the n-th prime (leading zeros are permitted) until another prime is reached.
- Lengths of the finite cycles in the permutation defined by A064413.A064793
Lengths of the finite cycles in the permutation defined by A064413.
- Minimal representatives for the finite cycles in the permutation defined by A064413.A064794
Minimal representatives for the finite cycles in the permutation defined by A064413.
- Home primes in base 2: primes reached when you start with n and (working in base 2) concatenate its prime factors (A048985); repeat until a prime is reached (or -1 if no prime is ever reached).A064795
Home primes in base 2: primes reached when you start with n and (working in base 2) concatenate its prime factors (A048985); repeat until a prime is reached (or -1 if no prime is ever reached).
- Largest integer m such that every permutation (p_1, ..., p_n) of (1, ..., n) satisfies p_i * p_{i+1} >= m for some i, 1 <= i <= n, where p_{n+1} = p_1.A064796
Largest integer m such that every permutation (p_1, ..., p_n) of (1, ..., n) satisfies p_i * p_{i+1} >= m for some i, 1 <= i <= n, where p_{n+1} = p_1.
- Largest integer m such that every permutation (p_1, ..., p_n) of (1, ..., n) satisfies lcm(p_i, p_{i+1}) >= m for some i, 1 <= i <= n, where p_{n+1} = p_1.A064797
Largest integer m such that every permutation (p_1, ..., p_n) of (1, ..., n) satisfies lcm(p_i, p_{i+1}) >= m for some i, 1 <= i <= n, where p_{n+1} = p_1.
- Sum of primes dividing the repunit numbers (with repetition).A064798
Sum of primes dividing the repunit numbers (with repetition).
- Sum of n-th prime number and n-th composite number.A064799
Sum of n-th prime number and n-th composite number.
- n plus the number of its prime factors: a(n) = n + A001222(n).A064800
n plus the number of its prime factors: a(n) = n + A001222(n).
- Take 1, skip 2, take 2, skip 3, take 3, etc.A064801
Take 1, skip 2, take 2, skip 3, take 3, etc.
- a(n) = Min { m > n | prime factorizations of m and n differ in one factor only}, a(1) = 1.A064802
a(n) = Min { m > n | prime factorizations of m and n differ in one factor only}, a(1) = 1.
- Number of subgroups of the group C_n X C_n X C_n (where C_n is the cyclic group of order n).A064803
Number of subgroups of the group C_n X C_n X C_n (where C_n is the cyclic group of order n).
- Numbers 2*k such that phi(2*k + 2) < phi(2*k).A064804
Numbers 2*k such that phi(2*k + 2) < phi(2*k).
- Numbers k such that phi(k) > phi(k+2).A064805
Numbers k such that phi(k) > phi(k+2).
- a(n) = n + digital root of n.A064806
a(n) = n + digital root of n.
- Numbers which are divisible by their digital root (A010888).A064807
Numbers which are divisible by their digital root (A010888).
- a(n) is the (n+1)st (n+2)-gonal number.A064808
a(n) is the (n+1)st (n+2)-gonal number.
- Decimal expansion of Pi written as a sequence of positive integers avoiding duplicates.A064809
Decimal expansion of Pi written as a sequence of positive integers avoiding duplicates.
- Self-locating strings within Pi: numbers n such that the string n is at position n in the decimal digits of Pi, where 1 is the 0th digit.A064810
Self-locating strings within Pi: numbers n such that the string n is at position n in the decimal digits of Pi, where 1 is the 0th digit.