Sequences
392,541 sequences
- Concatenation of increasing number of alternating digits in base 2, starting with 0.A065761
Concatenation of increasing number of alternating digits in base 2, starting with 0.
- a(n) = (sum of first n primes)^2 + sum of (squares of first n primes).A065762
a(n) = (sum of first n primes)^2 + sum of (squares of first n primes).
- Number of invertible Steinhaus matrices of order n.A065763
Number of invertible Steinhaus matrices of order n.
- Sum of divisors of square numbers.A065764
Sum of divisors of square numbers.
- Sum of divisors of twice square numbers.A065765
Sum of divisors of twice square numbers.
- Sum of divisors of twice a square number, divided by three.A065766
Sum of divisors of twice a square number, divided by three.
- Intersection of A065764 and A065765: n such that x and y exist with sigma[x^2] = n = sigma[2*(y^2)].A065767
Intersection of A065764 and A065765: n such that x and y exist with sigma[x^2] = n = sigma[2*(y^2)].
- Numbers that are sums of divisors of the odd squares; Intersection of A065764 and A065766, written in ascending order and duplicates removed.A065768
Numbers that are sums of divisors of the odd squares; Intersection of A065764 and A065766, written in ascending order and duplicates removed.
- Prime cascade: multiplicative with a(prime(m)^k) = prime(m-1) * prime(m)^(k-1).A065769
Prime cascade: multiplicative with a(prime(m)^k) = prime(m-1) * prime(m)^(k-1).
- Number of prime cascades to reach 1, where a prime cascade (A065769) is multiplicative with a(p(m)^k) = p(m-1) * p(m)^(k-1).A065770
Number of prime cascades to reach 1, where a prime cascade (A065769) is multiplicative with a(p(m)^k) = p(m-1) * p(m)^(k-1).
- Prime powers n such that both tau(n^2) and sigma(n^2) are composite numbers.A065771
Prime powers n such that both tau(n^2) and sigma(n^2) are composite numbers.
- Nontrivial prime powers k from A025475 such that tau(k^2) is prime but sigma(k^2) is a composite number.A065772
Nontrivial prime powers k from A025475 such that tau(k^2) is prime but sigma(k^2) is a composite number.
- Number of divisors of square of true prime powers arising in A065405.A065773
Number of divisors of square of true prime powers arising in A065405.
- Numbers k such that the product of the digits of k is equal to the sum of the prime factors of k, counted with multiplicity.A065774
Numbers k such that the product of the digits of k is equal to the sum of the prime factors of k, counted with multiplicity.
- Array T read by diagonals: T(i,j)=least number of knight's moves on a chessboard (infinite in all directions) needed to move from (0,0) to (i,j).A065775
Array T read by diagonals: T(i,j)=least number of knight's moves on a chessboard (infinite in all directions) needed to move from (0,0) to (i,j).
- a(n+1) is the next smallest square ending with a(n), initial term is 6.A065776
a(n+1) is the next smallest square ending with a(n), initial term is 6.
- a(1) = 4; for n > 1, a(n) is the square root of the smallest square > a(n-1)^2 with a(n-1)^2 forming its final digits.A065777
a(1) = 4; for n > 1, a(n) is the square root of the smallest square > a(n-1)^2 with a(n-1)^2 forming its final digits.
- a(1) = 16; for n > 1, a(n) is the smallest integer > 0 such that the concatenation a(n)a(n-1)...a(2)a(1) is a square.A065778
a(1) = 16; for n > 1, a(n) is the smallest integer > 0 such that the concatenation a(n)a(n-1)...a(2)a(1) is a square.
- Duplicate of A061839.A065779
Duplicate of A061839.
- a(1) = 5; for n > 1, a(n) is the square root of the smallest square > a(n-1)^2 with a(n-1)^2 forming its final digits.A065780
a(1) = 5; for n > 1, a(n) is the square root of the smallest square > a(n-1)^2 with a(n-1)^2 forming its final digits.
- a(1) = 25; for n > 1, a(n) is the smallest integer > 0 such that the concatenation a(n)a(n-1)...a(2)a(1) is a square.A065781
a(1) = 25; for n > 1, a(n) is the smallest integer > 0 such that the concatenation a(n)a(n-1)...a(2)a(1) is a square.
- a(1) = 36; for n > 1, a(n) is the smallest square > a(n-1) with a(n-1) forming its final digits.A065782
a(1) = 36; for n > 1, a(n) is the smallest square > a(n-1) with a(n-1) forming its final digits.
- a(1) = 6; for n > 1, a(n) is the square root of the smallest square > a(n-1)^2 with a(n-1)^2 forming its final digits.A065783
a(1) = 6; for n > 1, a(n) is the square root of the smallest square > a(n-1)^2 with a(n-1)^2 forming its final digits.
- a(1) = 36; for n > 1, a(n) is the smallest integer > 0 such that the concatenation a(n)a(n-1)...a(2)a(1) is a square.A065784
a(1) = 36; for n > 1, a(n) is the smallest integer > 0 such that the concatenation a(n)a(n-1)...a(2)a(1) is a square.
- a(1) = 49; for n > 1, a(n) is the smallest square > a(n-1) with a(n-1) forming its final digits.A065785
a(1) = 49; for n > 1, a(n) is the smallest square > a(n-1) with a(n-1) forming its final digits.
- a(1) = 7; for n > 1, a(n) is the square root of the smallest square > a(n-1)^2 with a(n-1)^2 forming its final digits.A065786
a(1) = 7; for n > 1, a(n) is the square root of the smallest square > a(n-1)^2 with a(n-1)^2 forming its final digits.
- a(1) = 49; for n > 1, a(n) is the smallest integer > 0 such that the concatenation a(n)a(n-1)...a(2)a(1) is a square.A065787
a(1) = 49; for n > 1, a(n) is the smallest integer > 0 such that the concatenation a(n)a(n-1)...a(2)a(1) is a square.
- a(1) = 64; for n > 1 a(n) is the smallest square > a(n-1) with a(n-1) forming its final digits.A065788
a(1) = 64; for n > 1 a(n) is the smallest square > a(n-1) with a(n-1) forming its final digits.
- a(1) = 8; for n > 1, a(n) is the square root of the smallest square > a(n-1)^2 with a(n-1)^2 forming its final digits.A065789
a(1) = 8; for n > 1, a(n) is the square root of the smallest square > a(n-1)^2 with a(n-1)^2 forming its final digits.
- a(1) = 64; for n > 1, a(n) is the smallest integer > 0 such that the concatenation a(n)a(n-1)...a(2)a(1) is a square.A065790
a(1) = 64; for n > 1, a(n) is the smallest integer > 0 such that the concatenation a(n)a(n-1)...a(2)a(1) is a square.
- a(1) = 81; for n > 1, a(n) is the smallest square > a(n-1) with a(n-1) forming its final digits.A065791
a(1) = 81; for n > 1, a(n) is the smallest square > a(n-1) with a(n-1) forming its final digits.
- a(1) = 9; for n > 1, a(n) is the square root of the smallest square > a(n-1)^2 with a(n-1)^2 forming its final digits.A065792
a(1) = 9; for n > 1, a(n) is the square root of the smallest square > a(n-1)^2 with a(n-1)^2 forming its final digits.
- a(1) = 81; for n > 1, a(n) is the smallest integer > 0 such that the concatenation a(n)a(n-1)...a(2)a(1) is a square.A065793
a(1) = 81; for n > 1, a(n) is the smallest integer > 0 such that the concatenation a(n)a(n-1)...a(2)a(1) is a square.
- Numbers k such that the sum of all possible subsequences of the digits in k, excluding k itself, is k.A065794
Numbers k such that the sum of all possible subsequences of the digits in k, excluding k itself, is k.
- Number of subsets of {1,2,...,n} that contain the average of their elements.A065795
Number of subsets of {1,2,...,n} that contain the average of their elements.
- Alternating sum of digits of n^2.A065796
Alternating sum of digits of n^2.
- Numbers k such that k^k - k + 1 is prime.A065797
Numbers k such that k^k - k + 1 is prime.
- Numbers k such that k^k - k - 1 is prime.A065798
Numbers k such that k^k - k - 1 is prime.
- Numbers k such that k^k + k! + k^2 + k + 1 is prime.A065799
Numbers k such that k^k + k! + k^2 + k + 1 is prime.
- Numbers k which, for some r, are r-digit maximizers of k/phi(k).A065800
Numbers k which, for some r, are r-digit maximizers of k/phi(k).
- Least k such that n^k > 2^n.A065801
Least k such that n^k > 2^n.
- How small is the squeezed n-gon? Let s0 be the side of a regular n-gon and s1 the side of the maximal n-gon which can be squeezed between the former and its circumcircle. The n-th entry in the sequence is floor(s0/s1).A065802
How small is the squeezed n-gon? Let s0 be the side of a regular n-gon and s1 the side of the maximal n-gon which can be squeezed between the former and its circumcircle. The n-th entry in the sequence is floor(s0/s1).
- a(n) = (sigma_2(n) mod 2) * (sigma_2(n) mod 5). Residue-product modulo 2 and 5 of sum of square of divisors.A065803
a(n) = (sigma_2(n) mod 2) * (sigma_2(n) mod 5). Residue-product modulo 2 and 5 of sum of square of divisors.
- Earliest sequence with a(a(n))=n!.A065804
Earliest sequence with a(a(n))=n!.
- a(n) = Sum_{j=0..n} sigma_j(n).A065805
a(n) = Sum_{j=0..n} sigma_j(n).
- A pseudo-random sequence.A065806
A pseudo-random sequence.
- Squares with a smaller square as final digits.A065807
Squares with a smaller square as final digits.
- Square of n has a smaller square as its final digits.A065808
Square of n has a smaller square as its final digits.
- a(n) is the smallest number m > n such that m is palindromic in base n and is not palindromic in bases b with 2 <= b < n.A065809
a(n) is the smallest number m > n such that m is palindromic in base n and is not palindromic in bases b with 2 <= b < n.
- Sorted positions of the elements of the quasicyclic group Z+(2a+1)/(2^b) [a > 0 and a < 2^(b-1), b > 0] at the ]0,1[ side of the Stern-Brocot Tree (A007305/A007306).A065810
Sorted positions of the elements of the quasicyclic group Z+(2a+1)/(2^b) [a > 0 and a < 2^(b-1), b > 0] at the ]0,1[ side of the Stern-Brocot Tree (A007305/A007306).