Sequences
392,541 sequences
- Permutation of N induced by rotating the node 1 (the top node) left in the infinite planar binary tree shown at A065658.A065661
Permutation of N induced by rotating the node 1 (the top node) left in the infinite planar binary tree shown at A065658.
- Permutation of N induced by rotating the node 2 right in the infinite planar binary tree shown at A065658.A065662
Permutation of N induced by rotating the node 2 right in the infinite planar binary tree shown at A065658.
- Permutation of N induced by rotating the node 2 left in the infinite planar binary tree shown at A065658.A065663
Permutation of N induced by rotating the node 2 left in the infinite planar binary tree shown at A065658.
- Permutation of N induced by rotating the node 3 right in the infinite planar binary tree shown at A065658.A065664
Permutation of N induced by rotating the node 3 right in the infinite planar binary tree shown at A065658.
- Permutation of N induced by rotating the node 3 left in the infinite planar binary tree shown at A065658.A065665
Permutation of N induced by rotating the node 3 left in the infinite planar binary tree shown at A065658.
- Permutation of N induced by rotating the node 4 right in the infinite planar binary tree shown at A065658.A065666
Permutation of N induced by rotating the node 4 right in the infinite planar binary tree shown at A065658.
- Permutation of N induced by rotating the node 4 left in the infinite planar binary tree shown at A065658.A065667
Permutation of N induced by rotating the node 4 left in the infinite planar binary tree shown at A065658.
- Permutation of N induced by rotating the node 5 right in the infinite planar binary tree shown at A065658.A065668
Permutation of N induced by rotating the node 5 right in the infinite planar binary tree shown at A065658.
- Permutation of N induced by rotating the node 5 left in the infinite planar binary tree shown at A065658.A065669
Permutation of N induced by rotating the node 5 left in the infinite planar binary tree shown at A065658.
- Permutation of N induced by rotating the node 6 right in the infinite planar binary tree shown at A065658.A065670
Permutation of N induced by rotating the node 6 right in the infinite planar binary tree shown at A065658.
- Permutation of N induced by rotating the node 6 left in the infinite planar binary tree shown at A065658.A065671
Permutation of N induced by rotating the node 6 left in the infinite planar binary tree shown at A065658.
- Permutation of N induced by rotating the node 7 right in the infinite planar binary tree shown at A065658.A065672
Permutation of N induced by rotating the node 7 right in the infinite planar binary tree shown at A065658.
- Permutation of N induced by rotating the node 7 left in the infinite planar binary tree shown at A065658.A065673
Permutation of N induced by rotating the node 7 left in the infinite planar binary tree shown at A065658.
- 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).A065674
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).
- The exponent of 2 in the fractions of the range ]0,1[ Stern-Brocot tree (A007305/A007306) [1/2, 1/3, 2/3, 1/4, 2/5, 3/5, 3/4, 1/5, 2/7, 3/8, 3/7, 4/7, 5/8, 5/7, 4/5, ...].A065675
The exponent of 2 in the fractions of the range ]0,1[ Stern-Brocot tree (A007305/A007306) [1/2, 1/3, 2/3, 1/4, 2/5, 3/5, 3/4, 1/5, 2/7, 3/8, 3/7, 4/7, 5/8, 5/7, 4/5, ...].
- The exponent of 2 in the fractions of the whole ]0, inf[ Stern-Brocot tree (A007305/A047679) [1/1, 1/2, 2/1, 1/3, 2/3, 3/2, 3/1, 1/4, 2/5, 3/5, 3/4, 4/3, 5/3, 5/2, 4/1, ...].A065676
The exponent of 2 in the fractions of the whole ]0, inf[ Stern-Brocot tree (A007305/A047679) [1/1, 1/2, 2/1, 1/3, 2/3, 3/2, 3/1, 1/4, 2/5, 3/5, 3/4, 4/3, 5/3, 5/2, 4/1, ...].
- Maximal Diffy_length for quadruples of numbers <= n.A065677
Maximal Diffy_length for quadruples of numbers <= n.
- Minimum value t such that all quadruples of Diffy_length >= n have a maximal value >= t.A065678
Minimum value t such that all quadruples of Diffy_length >= n have a maximal value >= t.
- If n is even, a(n) = n^2 else a(n) = n.A065679
If n is even, a(n) = n^2 else a(n) = n.
- Number of primes <= prime(n) which begin with a 1.A065680
Number of primes <= prime(n) which begin with a 1.
- Number of primes <= prime(n) which begin with a 2.A065681
Number of primes <= prime(n) which begin with a 2.
- Number of primes <= prime(n) which begin with a 3.A065682
Number of primes <= prime(n) which begin with a 3.
- Number of primes <= prime(n) which begin with a 4.A065683
Number of primes <= prime(n) which begin with a 4.
- Number of primes <= prime(n) which begin with a 5.A065684
Number of primes <= prime(n) which begin with a 5.
- Number of primes <= prime(n) which begin with a 6.A065685
Number of primes <= prime(n) which begin with a 6.
- Number of primes <= prime(n) which begin with a 7.A065686
Number of primes <= prime(n) which begin with a 7.
- Number of primes <= prime(n) which begin with an 8.A065687
Number of primes <= prime(n) which begin with an 8.
- First prime in the smallest (nontrivial) prime k-tuplet.A065688
First prime in the smallest (nontrivial) prime k-tuplet.
- a(1) = 0; for n > 1, a(n) is the smallest square > a(n-1) with a(n-1) forming its final digits.A065689
a(1) = 0; for n > 1, a(n) is the smallest square > a(n-1) with a(n-1) forming its final digits.
- a(1) = 0; 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.A065690
a(1) = 0; 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) = 0; 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.A065691
a(1) = 0; 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.
- Braided power sequence: this is b(n+1) = 3*b(n) + 2*d(n) - c(n), A065693 is c(n+1) = 3*c(n) + 2*b(n) - d(n) and A065694 is d(n+1) = 3*d(n) + 2*c(n) - b(n), starting with b(0) = 0, c(0) = 1 and d(0) = 2.A065692
Braided power sequence: this is b(n+1) = 3*b(n) + 2*d(n) - c(n), A065693 is c(n+1) = 3*c(n) + 2*b(n) - d(n) and A065694 is d(n+1) = 3*d(n) + 2*c(n) - b(n), starting with b(0) = 0, c(0) = 1 and d(0) = 2.
- Braided power sequence: A065692 is b(n+1) = 3*b(n) + 2*d(n) - c(n), this is c(n+1) = 3*c(n) + 2*b(n) - d(n) and A065694 is d(n+1) = 3*d(n) + 2*c(n) - b(n), starting with b(0) = 0, c(0) = 1 and d(0) = 2.A065693
Braided power sequence: A065692 is b(n+1) = 3*b(n) + 2*d(n) - c(n), this is c(n+1) = 3*c(n) + 2*b(n) - d(n) and A065694 is d(n+1) = 3*d(n) + 2*c(n) - b(n), starting with b(0) = 0, c(0) = 1 and d(0) = 2.
- Braided power sequence: A065692 is b(n+1) = 3*b(n) + 2*d(n) - c(n), A065693 is c(n+1) = 3*c(n) + 2*b(n) - d(n) and this is d(n+1) = 3*d(n) + 2*c(n) - b(n), starting with b(0) = 0, c(0) = 1 and d(0) = 2.A065694
Braided power sequence: A065692 is b(n+1) = 3*b(n) + 2*d(n) - c(n), A065693 is c(n+1) = 3*c(n) + 2*b(n) - d(n) and this is d(n+1) = 3*d(n) + 2*c(n) - b(n), starting with b(0) = 0, c(0) = 1 and d(0) = 2.
- Numbers m such that N = (am+1)(bm+1)(cm+1) is a 3-Carmichael number (A087788), where a,b,c = 1,2,53.A065695
Numbers m such that N = (am+1)(bm+1)(cm+1) is a 3-Carmichael number (A087788), where a,b,c = 1,2,53.
- Numbers m such that N = (am+1)(bm+1)(cm+1) is a 3-Carmichael number (A087788), where a,b,c = 1,2,55.A065696
Numbers m such that N = (am+1)(bm+1)(cm+1) is a 3-Carmichael number (A087788), where a,b,c = 1,2,55.
- Values of m such that N = (am+1)(bm+1)(cm+1) is a 3-Carmichael number (A087788), where a,b,c = 1,2,57.A065697
Values of m such that N = (am+1)(bm+1)(cm+1) is a 3-Carmichael number (A087788), where a,b,c = 1,2,57.
- Numbers m such that N = (am+1)(bm+1)(cm+1) is a 3-Carmichael number (A087788), where a,b,c = 1,2,61.A065698
Numbers m such that N = (am+1)(bm+1)(cm+1) is a 3-Carmichael number (A087788), where a,b,c = 1,2,61.
- Values of m such that N = (am+1)(bm+1)(cm+1) is a 3-Carmichael number (A087788), where a,b,c = 1,2,63.A065699
Values of m such that N = (am+1)(bm+1)(cm+1) is a 3-Carmichael number (A087788), where a,b,c = 1,2,63.
- Values of m such that N = (am+1)(bm+1)(cm+1) is a 3-Carmichael number (A087788), where a,b,c = 1,2,65.A065700
Values of m such that N = (am+1)(bm+1)(cm+1) is a 3-Carmichael number (A087788), where a,b,c = 1,2,65.
- Numbers m such that N = (am+1)(bm+1)(cm+1) is a 3-Carmichael number (A087788), where a,b,c = 1,2,67.A065701
Numbers m such that N = (am+1)(bm+1)(cm+1) is a 3-Carmichael number (A087788), where a,b,c = 1,2,67.
- Values of m such that N = (am+1)(bm+1)(cm+1) is a 3-Carmichael number (A087788), where a,b,c = 1,2,69.A065702
Values of m such that N = (am+1)(bm+1)(cm+1) is a 3-Carmichael number (A087788), where a,b,c = 1,2,69.
- Values of m such that N = (m+1)(2m+1)(71m+1) is a 3-Carmichael number (A087788).A065703
Values of m such that N = (m+1)(2m+1)(71m+1) is a 3-Carmichael number (A087788).
- Number of squares or twice squares dividing n.A065704
Number of squares or twice squares dividing n.
- a(n) = Lucas(10*n).A065705
a(n) = Lucas(10*n).
- Least member p1 of prime octuplets (p1, p2, p3, ..., p8 = p1 + 26), the eight p's being consecutive primes.A065706
Least member p1 of prime octuplets (p1, p2, p3, ..., p8 = p1 + 26), the eight p's being consecutive primes.
- Bessel polynomial {y_n}'(-2).A065707
Bessel polynomial {y_n}'(-2).
- a(n) is the position of A037183(n) in a sorted list of the terms of A037183.A065708
a(n) is the position of A037183(n) in a sorted list of the terms of A037183.
- Reduced sequence related to reciprocal Pythagorean triples: 1/a(n)^2 + 1/k^2 = 1/j^2 has an integer solution (k,j) with k<a(n) and a(n) not a multiple of 20.A065709
Reduced sequence related to reciprocal Pythagorean triples: 1/a(n)^2 + 1/k^2 = 1/j^2 has an integer solution (k,j) with k<a(n) and a(n) not a multiple of 20.
- Number of 2's in the decimal expansion of 2^n.A065710
Number of 2's in the decimal expansion of 2^n.