Sequences
392,541 sequences
- Signature-permutation of a Catalan Automorphism: rotate one step counterclockwise the triangulations of polygons encoded by A014486.A057161
Signature-permutation of a Catalan Automorphism: rotate one step counterclockwise the triangulations of polygons encoded by A014486.
- Signature-permutation of a Catalan Automorphism: rotate one step clockwise the triangulations of polygons encoded by A014486.A057162
Signature-permutation of a Catalan Automorphism: rotate one step clockwise the triangulations of polygons encoded by A014486.
- Signature-permutation of a Catalan automorphism: Reflect a rooted plane binary tree; Deutsch's 1998 involution on Dyck paths.A057163
Signature-permutation of a Catalan automorphism: Reflect a rooted plane binary tree; Deutsch's 1998 involution on Dyck paths.
- Self-inverse permutation of natural numbers induced by reflections of the rooted plane trees and mountain ranges encoded by A014486.A057164
Self-inverse permutation of natural numbers induced by reflections of the rooted plane trees and mountain ranges encoded by A014486.
- Indices of addition steps in Recamán's sequence A005132.A057165
Indices of addition steps in Recamán's sequence A005132.
- Indices of subtraction steps in Recamán's sequence A005132.A057166
Indices of subtraction steps in Recamán's sequence A005132.
- Term in Recamán's sequence A005132 where n appears for first time, or -1 if n never appears.A057167
Term in Recamán's sequence A005132 where n appears for first time, or -1 if n never appears.
- Next larger integer with same binary weight (number of 1 bits) as n.A057168
Next larger integer with same binary weight (number of 1 bits) as n.
- Least integer with the same nonzero decimal digits as n and one more 0 digit.A057169
Least integer with the same nonzero decimal digits as n and one more 0 digit.
- 2-enumeration of 2n X 2n half-turn symmetric alternating-sign matrices.A057170
2-enumeration of 2n X 2n half-turn symmetric alternating-sign matrices.
- Numbers n such that (5^n+1)/6 is a prime.A057171
Numbers n such that (5^n+1)/6 is a prime.
- Numbers n such that (6^n + 1)/7 is a prime.A057172
Numbers n such that (6^n + 1)/7 is a prime.
- Numbers k such that (7^k + 1)/8 is a prime.A057173
Numbers k such that (7^k + 1)/8 is a prime.
- a(n+3)=a(n)+a(n+1)-a(n+2), starting with 1,2,3.A057174
a(n+3)=a(n)+a(n+1)-a(n+2), starting with 1,2,3.
- Numbers n such that (9^n + 1)/10 is a prime.A057175
Numbers n such that (9^n + 1)/10 is a prime.
- a(0) = 1; for n >= 1, a(n) = Sum_{j=0..a(n-1) mod n} a(j).A057176
a(0) = 1; for n >= 1, a(n) = Sum_{j=0..a(n-1) mod n} a(j).
- Numbers n such that (11^n + 1)/12 is a prime.A057177
Numbers n such that (11^n + 1)/12 is a prime.
- Numbers k such that (12^k + 1)/13 is a prime.A057178
Numbers k such that (12^k + 1)/13 is a prime.
- Numbers n such that (13^n + 1)/14 is a prime.A057179
Numbers n such that (13^n + 1)/14 is a prime.
- Numbers k such that (14^k + 1)/15 is a prime.A057180
Numbers k such that (14^k + 1)/15 is a prime.
- Numbers n such that (15^n + 1)/16 is a prime.A057181
Numbers n such that (15^n + 1)/16 is a prime.
- Numbers n such that (16^n + 1)/17 is a prime.A057182
Numbers n such that (16^n + 1)/17 is a prime.
- Numbers k such that (17^k + 1)/18 is a prime.A057183
Numbers k such that (17^k + 1)/18 is a prime.
- Numbers n such that (18^n + 1)/19 is a prime.A057184
Numbers n such that (18^n + 1)/19 is a prime.
- Numbers n such that (19^n + 1)/20 is a prime.A057185
Numbers n such that (19^n + 1)/20 is a prime.
- Numbers k such that (20^k+1)/21 is a prime.A057186
Numbers k such that (20^k+1)/21 is a prime.
- Numbers n such that (21^n+1)/22 is a prime.A057187
Numbers n such that (21^n+1)/22 is a prime.
- Numbers n such that (22^n+1)/23 is a prime.A057188
Numbers n such that (22^n+1)/23 is a prime.
- Numbers n such that (23^n+1)/24 is a prime.A057189
Numbers n such that (23^n+1)/24 is a prime.
- Numbers k such that (24^k+1)/25 is a prime.A057190
Numbers k such that (24^k+1)/25 is a prime.
- Numbers n such that (25^n+1)/26 is a prime.A057191
Numbers n such that (25^n+1)/26 is a prime.
- Least m such that 1 + prime(n)*2^m is a prime, or -1 if no such m exists.A057192
Least m such that 1 + prime(n)*2^m is a prime, or -1 if no such m exists.
- Numbers n such that n | 12^n + 11^n.A057193
Numbers n such that n | 12^n + 11^n.
- a(1) = 1; a(n+1) = (Product_{k=1..n} a(k)) * Sum_{k=1..n} a(k).A057194
a(1) = 1; a(n+1) = (Product_{k=1..n} a(k)) * Sum_{k=1..n} a(k).
- Numbers k such that 2^k + 7 is prime.A057195
Numbers k such that 2^k + 7 is prime.
- Numbers k such that 2^k + 9 is prime.A057196
Numbers k such that 2^k + 9 is prime.
- Numbers k such that 2^k + 15 is prime.A057197
Numbers k such that 2^k + 15 is prime.
- a(n) = (5*3^(n-1)+1)/2.A057198
a(n) = (5*3^(n-1)+1)/2.
- The first nontrivial (k>n+2) palindromic prime in both bases n and n+2 or -1 if it does not exist.A057199
The first nontrivial (k>n+2) palindromic prime in both bases n and n+2 or -1 if it does not exist.
- Numbers k such that 2^k + 17 is prime.A057200
Numbers k such that 2^k + 17 is prime.
- Numbers k such that 2^k + 21 is prime.A057201
Numbers k such that 2^k + 21 is prime.
- Numbers n such that 2^n - 21 is prime.A057202
Numbers n such that 2^n - 21 is prime.
- Numbers k such that 2^k + 23 is prime.A057203
Numbers k such that 2^k + 23 is prime.
- Primes congruent to 1 mod 6 generated recursively. Initial prime is 7. The next term is p(n) = Min_{p is prime; p divides 4Q^2+3; p mod 6 = 1}, where Q is the product of previous entries of the sequence.A057204
Primes congruent to 1 mod 6 generated recursively. Initial prime is 7. The next term is p(n) = Min_{p is prime; p divides 4Q^2+3; p mod 6 = 1}, where Q is the product of previous entries of the sequence.
- Primes congruent to 3 modulo 4 generated recursively: a(n) = Min_{p, prime; p mod 4 = 3; p|4Q-1}, where Q is the product of all previous terms in the sequence. The initial term is 3.A057205
Primes congruent to 3 modulo 4 generated recursively: a(n) = Min_{p, prime; p mod 4 = 3; p|4Q-1}, where Q is the product of all previous terms in the sequence. The initial term is 3.
- Primes of the form 6k+5 generated recursively: a(1)=5; a(n) = min{p, prime; p mod 6 = 5; p | 6Q-1}, where Q is the product of all previous terms in the sequence.A057206
Primes of the form 6k+5 generated recursively: a(1)=5; a(n) = min{p, prime; p mod 6 = 5; p | 6Q-1}, where Q is the product of all previous terms in the sequence.
- a(1)=5, a(n) is the smallest prime dividing 4*Q^2 + 1 where Q is the product of all previous terms in the sequence.A057207
a(1)=5, a(n) is the smallest prime dividing 4*Q^2 + 1 where Q is the product of all previous terms in the sequence.
- Primes of the form 8k+5 generated recursively: a(1)=5, a(n) = least prime p == 5 (mod 8) with p | 4+Q^2, where Q is the product of all previous terms in the sequence.A057208
Primes of the form 8k+5 generated recursively: a(1)=5, a(n) = least prime p == 5 (mod 8) with p | 4+Q^2, where Q is the product of all previous terms in the sequence.
- n!^n *sum_{k=1 to n}[1/k^k].A057209
n!^n *sum_{k=1 to n}[1/k^k].
- Number of fullerenes with 2n vertices (or carbon atoms), counting enantiomorphic pairs as distinct.A057210
Number of fullerenes with 2n vertices (or carbon atoms), counting enantiomorphic pairs as distinct.