Sequences
392,541 sequences
- Let u(n,k) be the recursion: u(n,1)=1, u(n,2)=n, u(n,k+2) = (1/2) * (u(n,k+1)+u(n,k)) if u(n,k+1)+u(n,k) is even, and u(n,k+2) = abs(u(n,k+1)-u(n,k)) otherwise. Sequence gives integer values a(n) such that u(n,k)=1 for any k>=a(n).A069211
Let u(n,k) be the recursion: u(n,1)=1, u(n,2)=n, u(n,k+2) = (1/2) * (u(n,k+1)+u(n,k)) if u(n,k+1)+u(n,k) is even, and u(n,k+2) = abs(u(n,k+1)-u(n,k)) otherwise. Sequence gives integer values a(n) such that u(n,k)=1 for any k>=a(n).
- a(n) = Sum_{k=1..n} 3^omega(k).A069212
a(n) = Sum_{k=1..n} 3^omega(k).
- a(n) = n-th positive integer relatively prime to n.A069213
a(n) = n-th positive integer relatively prime to n.
- Let u(n,k) be the recursion defined by u(n,1)=1, u(n,2)=2, u(n,3)=n, and u(n,k+3) = (u(n,k+2) + u(n,k+1))/u(n,k) if u(n,k) divides u(n,k+2) + u(n,k+1), u(n,k+3) = u(n,k) otherwise. Then u(n,k) is periodic and a(n) = Max(u(n,k), k >= 1).A069214
Let u(n,k) be the recursion defined by u(n,1)=1, u(n,2)=2, u(n,3)=n, and u(n,k+3) = (u(n,k+2) + u(n,k+1))/u(n,k) if u(n,k) divides u(n,k+2) + u(n,k+1), u(n,k+3) = u(n,k) otherwise. Then u(n,k) is periodic and a(n) = Max(u(n,k), k >= 1).
- Numbers n such that phi(n) = reversal(n).A069215
Numbers n such that phi(n) = reversal(n).
- Numbers n such that sigma(n) = reversal(n).A069216
Numbers n such that sigma(n) = reversal(n).
- Numbers n such that phi(n) + sigma(n) = n + reversal(n).A069217
Numbers n such that phi(n) + sigma(n) = n + reversal(n).
- a(1)=1, a(2)=8; for n >= 1, a(n+2)=(a(n+1)+a(n))/3 if (a(n+1)+a(n)==0 (mod 3)); a(n+2)=(a(n+1)+a(n))/2 if (a(n+1)+a(n)==0 (mod 2)); a(n+2)=a(n+1)+a(n) otherwise.A069218
a(1)=1, a(2)=8; for n >= 1, a(n+2)=(a(n+1)+a(n))/3 if (a(n+1)+a(n)==0 (mod 3)); a(n+2)=(a(n+1)+a(n))/2 if (a(n+1)+a(n)==0 (mod 2)); a(n+2)=a(n+1)+a(n) otherwise.
- Number of cyclic primes with n digits.A069219
Number of cyclic primes with n digits.
- Denominator of Sum_{1<=k<=n, gcd(k,n)=1} 1/k.A069220
Denominator of Sum_{1<=k<=n, gcd(k,n)=1} 1/k.
- a(1) = a(2) = 1; a(n) = <>(a(n-1)) + <>(a(n-2)) for n > 2, where <>(k) denotes the concatenation of k with itself.A069221
a(1) = a(2) = 1; a(n) = <>(a(n-1)) + <>(a(n-2)) for n > 2, where <>(k) denotes the concatenation of k with itself.
- a(1) = a(2) = 1; a(n) = <rev>(a(n-1)) + <rev>(a(n-2)) for n > 2, where <rev>(k) denotes the concatenation of k with its reversal.A069222
a(1) = a(2) = 1; a(n) = <rev>(a(n-1)) + <rev>(a(n-2)) for n > 2, where <rev>(k) denotes the concatenation of k with its reversal.
- Generalized Bell numbers: row 3 of A090210.A069223
Generalized Bell numbers: row 3 of A090210.
- Numbers n such that n^2 + n + A007918(n+2) is prime.A069224
Numbers n such that n^2 + n + A007918(n+2) is prime.
- Numbers k such that phi(k) is the reversal of sigma(k).A069225
Numbers k such that phi(k) is the reversal of sigma(k).
- a(n) = gcd(n, 2^n + 1).A069226
a(n) = gcd(n, 2^n + 1).
- a(1)=1, a(2)=2; a(n+2) = (a(n+1) + a(n))/b(n) where b(n) = gcd(a(n+1) + a(n), 4).A069227
a(1)=1, a(2)=2; a(n+2) = (a(n+1) + a(n))/b(n) where b(n) = gcd(a(n+1) + a(n), 4).
- a(1)=1, a(2)=4, a(n+2)=(a(n+1)+a(n))/b(n), where b(n)=gcd(a(n+1)+a(n),4).A069228
a(1)=1, a(2)=4, a(n+2)=(a(n+1)+a(n))/b(n), where b(n)=gcd(a(n+1)+a(n),4).
- a(n) = n*(2^n + 1).A069229
a(n) = n*(2^n + 1).
- Number of primes p such that n < p < n + tau(n)^2 where tau(n) = A000005(n).A069230
Number of primes p such that n < p < n + tau(n)^2 where tau(n) = A000005(n).
- Numbers n such that there are exactly 3 primes p satisfying the inequality n < p < n + tau(n)^2 where tau(n) = A000005(n).A069231
Numbers n such that there are exactly 3 primes p satisfying the inequality n < p < n + tau(n)^2 where tau(n) = A000005(n).
- Numbers n such that there are exactly 2 primes p satisfying the inequality n < p < n + tau(n)^2 where tau(n) = A000005(n).A069232
Numbers n such that there are exactly 2 primes p satisfying the inequality n < p < n + tau(n)^2 where tau(n) = A000005(n).
- Numbers k such that there is exactly 1 prime p satisfying the inequality k < p < k + tau(k)^2 where tau(k) = A000005(k).A069233
Numbers k such that there is exactly 1 prime p satisfying the inequality k < p < k + tau(k)^2 where tau(k) = A000005(k).
- Numbers k such that the sum over the prime divisors of k equals the number of divisors of k.A069234
Numbers k such that the sum over the prime divisors of k equals the number of divisors of k.
- Numbers k, not perfect squares, such that the squarefree part of k divides sigma(k).A069235
Numbers k, not perfect squares, such that the squarefree part of k divides sigma(k).
- Integers m, not a perfect square, such that the squarefree part of m divides phi(m).A069236
Integers m, not a perfect square, such that the squarefree part of m divides phi(m).
- Composite numbers k such that tau(k) divides phi(k), where tau(k) is the number of divisors of k and phi(k) the Euler totient function.A069237
Composite numbers k such that tau(k) divides phi(k), where tau(k) is the number of divisors of k and phi(k) the Euler totient function.
- Numerator of coefficient G_n defined by Sum_{ (m,m') != (0,0)} 1/(m+m'*sqrt(-2))^(2*n) = (4*w)^(2*n)*G_n/(2*n)!, where 2w is one of the periods of the associated Weierstrass P-function.A069238
Numerator of coefficient G_n defined by Sum_{ (m,m') != (0,0)} 1/(m+m'*sqrt(-2))^(2*n) = (4*w)^(2*n)*G_n/(2*n)!, where 2w is one of the periods of the associated Weierstrass P-function.
- Denominator of coefficient G_n defined by Sum_{ (m,m') != (0,0)} 1/(m+m'*sqrt(-2))^(2*n) = (4*w)^(2*n)*G_n/(2*n)!, where 2w is one of the periods of the associated Weierstrass P-function.A069239
Denominator of coefficient G_n defined by Sum_{ (m,m') != (0,0)} 1/(m+m'*sqrt(-2))^(2*n) = (4*w)^(2*n)*G_n/(2*n)!, where 2w is one of the periods of the associated Weierstrass P-function.
- Integers arising from partial fraction decomposition of numbers G_n defined by A069238/A069239.A069240
Integers arising from partial fraction decomposition of numbers G_n defined by A069238/A069239.
- Number of Hamiltonian paths in the graph on n vertices {1,...,n}, with i adjacent to j iff |i-j| <= 2.A069241
Number of Hamiltonian paths in the graph on n vertices {1,...,n}, with i adjacent to j iff |i-j| <= 2.
- Numerators of coefficients in Airy-type asymptotic expansion.A069242
Numerators of coefficients in Airy-type asymptotic expansion.
- Denominators of coefficients in Airy-type asymptotic expansion.A069243
Denominators of coefficients in Airy-type asymptotic expansion.
- Numerators of coefficients in Airy-type asymptotic expansion.A069244
Numerators of coefficients in Airy-type asymptotic expansion.
- Denominators of coefficients in Airy-type asymptotic expansion.A069245
Denominators of coefficients in Airy-type asymptotic expansion.
- Primes which yield a prime whenever a 1 is inserted anywhere in them (including at the beginning or end).A069246
Primes which yield a prime whenever a 1 is inserted anywhere in them (including at the beginning or end).
- Expansion of Molien series for Clifford group for the Quebbemann codes over F_8.A069247
Expansion of Molien series for Clifford group for the Quebbemann codes over F_8.
- Number of positive divisors of n themselves divisible by largest prime that divides n.A069248
Number of positive divisors of n themselves divisible by largest prime that divides n.
- a(n) = n^2 - phi(n)*sigma(n).A069249
a(n) = n^2 - phi(n)*sigma(n).
- Sum of the reversals of the proper divisors of n.A069250
Sum of the reversals of the proper divisors of n.
- Number of basis partitions of n+64 with Durfee square size 8.A069251
Number of basis partitions of n+64 with Durfee square size 8.
- Number of basis partitions of n+81 with Durfee square size 9.A069252
Number of basis partitions of n+81 with Durfee square size 9.
- Number of basis partitions of n+100 with Durfee square size 10.A069253
Number of basis partitions of n+100 with Durfee square size 10.
- k/10 when gcd(k, 2^k+1) = 5.A069254
k/10 when gcd(k, 2^k+1) = 5.
- a(n) = (2^((2*n-1)^2)+1)/(2^(2*n-1)+1).A069255
a(n) = (2^((2*n-1)^2)+1)/(2^(2*n-1)+1).
- Size of the Sylow 2-subgroup of the group GL_2(Z_n): maximal power of 2 that divides A000252(n).A069256
Size of the Sylow 2-subgroup of the group GL_2(Z_n): maximal power of 2 that divides A000252(n).
- Denominator of the last term of the Egyptian fraction sum (using the greedy algorithm) which satisfies 1 = 1/n + 1/(n+1) + 1/(n+2) ... 1/a(n).A069257
Denominator of the last term of the Egyptian fraction sum (using the greedy algorithm) which satisfies 1 = 1/n + 1/(n+1) + 1/(n+2) ... 1/a(n).
- Triangle T(n,k) = number of partitions of 2*n into n-k prime parts, n>1, 0 <= k <= n-2.A069258
Triangle T(n,k) = number of partitions of 2*n into n-k prime parts, n>1, 0 <= k <= n-2.
- Limit of A069258(k,n) = number of partitions of 2*k into k-n prime parts, as k tends to infinity.A069259
Limit of A069258(k,n) = number of partitions of 2*k into k-n prime parts, as k tends to infinity.
- a(n) = core(1)*core(2)*...*core(n) where core(n) is the squarefree part of n (A007913).A069260
a(n) = core(1)*core(2)*...*core(n) where core(n) is the squarefree part of n (A007913).