Sequences
392,541 sequences
- 6 * Sum_{d|n} (d mod 3).A093061
6 * Sum_{d|n} (d mod 3).
- a(n) = Fibonacci(prime(n)) - prime(Fibonacci(n)).A093062
a(n) = Fibonacci(prime(n)) - prime(Fibonacci(n)).
- Decimal expansion of (2 + 4*sqrt(2) + (4 + sqrt(2))*arcsinh(1))/30.A093063
Decimal expansion of (2 + 4*sqrt(2) + (4 + sqrt(2))*arcsinh(1))/30.
- Decimal expansion of (4 + 3*log(3))/20.A093064
Decimal expansion of (4 + 3*log(3))/20.
- Expansion of (eta(q^3)eta(q^15)/(eta(q)eta(q^5)))^2 in powers of q.A093065
Expansion of (eta(q^3)eta(q^15)/(eta(q)eta(q^5)))^2 in powers of q.
- Decimal expansion of (4 + 17*sqrt(2) - 6*sqrt(3) - 7*Pi + 21*log(1+sqrt(2)) + 42*log(2+sqrt(3)))/75.A093066
Decimal expansion of (4 + 17*sqrt(2) - 6*sqrt(3) - 7*Pi + 21*log(1+sqrt(2)) + 42*log(2+sqrt(3)))/75.
- McKay-Thompson series of class 24f for the Monster group with a(0) = -2.A093067
McKay-Thompson series of class 24f for the Monster group with a(0) = -2.
- Expansion of (eta(q^3)^2 * eta(q^7) * eta(q^63)) / (eta(q) * eta(q^9) * eta(q^21)^2) in powers of q.A093068
Expansion of (eta(q^3)^2 * eta(q^7) * eta(q^63)) / (eta(q) * eta(q^9) * eta(q^21)^2) in powers of q.
- a(n) = (2^n + 1)^2 - 2.A093069
a(n) = (2^n + 1)^2 - 2.
- Decimal expansion of 128/(45*Pi).A093070
Decimal expansion of 128/(45*Pi).
- Lesser of a pair of records in A066272.A093071
Lesser of a pair of records in A066272.
- Decimal expansion of 97/150 + Pi/40.A093072
Decimal expansion of 97/150 + Pi/40.
- McKay-Thompson series of class 18A for the Monster group with a(0) = -1.A093073
McKay-Thompson series of class 18A for the Monster group with a(0) = -1.
- Greatest prime factor of n and its direct neighbors.A093074
Greatest prime factor of n and its direct neighbors.
- Indicating the neighbor with a greater greatest prime factor.A093075
Indicating the neighbor with a greater greatest prime factor.
- Number of steps to factor n!+1 using Fermat's factorization method.A093076
Number of steps to factor n!+1 using Fermat's factorization method.
- Primes p = prime(i) such that p(i)# + p(i+1) is prime.A093077
Primes p = prime(i) such that p(i)# + p(i+1) is prime.
- Primes p = prime(i) such that p(i)# - p(i+1) is prime.A093078
Primes p = prime(i) such that p(i)# - p(i+1) is prime.
- Position of first occurrence of n in A091966.A093079
Position of first occurrence of n in A091966.
- Indices of records in A091966.A093080
Indices of records in A091966.
- Records in A091966.A093081
Records in A091966.
- Number of steps to factor n!-1 using Fermat's factorization method.A093082
Number of steps to factor n!-1 using Fermat's factorization method.
- Partial sums of digits of decimal expansion of golden ratio phi.A093083
Partial sums of digits of decimal expansion of golden ratio phi.
- Partial sums of digits of decimal expansion of Euler's constant gamma.A093084
Partial sums of digits of decimal expansion of Euler's constant gamma.
- Expansion of phi(-x) / psi(x^4) in powers of x where phi(), psi() are Ramanujan theta functions.A093085
Expansion of phi(-x) / psi(x^4) in powers of x where phi(), psi() are Ramanujan theta functions.
- "Fibonacci in digits": start with a(0)=0, a(1)=1; repeatedly adjoin the digits of the sum of the next two terms.A093086
"Fibonacci in digits": start with a(0)=0, a(1)=1; repeatedly adjoin the digits of the sum of the next two terms.
- "Lucas in digits": start with a(1)=1, a(2)=3; repeatedly adjoin digits of sum of next two terms.A093087
"Lucas in digits": start with a(1)=1, a(2)=3; repeatedly adjoin digits of sum of next two terms.
- "Fibonacci-like in digits": start with a(1)=1, a(2)=4; repeatedly adjoin digits of sum of previous two terms.A093088
"Fibonacci-like in digits": start with a(1)=1, a(2)=4; repeatedly adjoin digits of sum of previous two terms.
- "Fibonacci in pairs": start with a(1)=1, a(2)=1; repeatedly adjoin sum of previous two terms but chopped from the right into pairs of 2 digits.A093089
"Fibonacci in pairs": start with a(1)=1, a(2)=1; repeatedly adjoin sum of previous two terms but chopped from the right into pairs of 2 digits.
- Start with a(1)=1, a(2)=3, apply rule of A093089.A093090
Start with a(1)=1, a(2)=3, apply rule of A093089.
- "Fibonacci in pairs from left": start with a(1)=1, a(2)=1; repeatedly adjoin sum of previous two terms but chopped from the left into pairs of 2 digits.A093091
"Fibonacci in pairs from left": start with a(1)=1, a(2)=1; repeatedly adjoin sum of previous two terms but chopped from the left into pairs of 2 digits.
- "Fibonacci in digits - up and down": start with a(1)=1, a(2)=1; repeatedly adjoin either the sum of the two previous terms (if that sum happens to be even) or else adjoin digits of the sum of previous two terms (if that sum happens to be odd).A093092
"Fibonacci in digits - up and down": start with a(1)=1, a(2)=1; repeatedly adjoin either the sum of the two previous terms (if that sum happens to be even) or else adjoin digits of the sum of previous two terms (if that sum happens to be odd).
- "Fibonacci in digits - up and down": start with a(1)=1, a(2)=1; repeatedly adjoin either the sum of the two previous terms (if that sum happens to be odd) or else adjoin digits of the sum of previous two terms (if that sum happens to be even).A093093
"Fibonacci in digits - up and down": start with a(1)=1, a(2)=1; repeatedly adjoin either the sum of the two previous terms (if that sum happens to be odd) or else adjoin digits of the sum of previous two terms (if that sum happens to be even).
- "Products into digits": start with a(1)=2, a(2)=2; adjoin digits of product of a(k) and a(k+1) for k from 1 to infinity.A093094
"Products into digits": start with a(1)=2, a(2)=2; adjoin digits of product of a(k) and a(k+1) for k from 1 to infinity.
- Start with a(1) = 2, a(2) = 3, then apply the rule of A093094.A093095
Start with a(1) = 2, a(2) = 3, then apply the rule of A093094.
- Start with a(1) = a(2) = 3; then apply the rule of A093094.A093096
Start with a(1) = a(2) = 3; then apply the rule of A093094.
- Start with a(1) = 3, a(2) = 7; then apply the rule of A093094.A093097
Start with a(1) = 3, a(2) = 7; then apply the rule of A093094.
- "Power into digits": start with a(1)=2, a(2)=3; repeatedly adjoin digits of a(n-2)^a(n-1).A093098
"Power into digits": start with a(1)=2, a(2)=3; repeatedly adjoin digits of a(n-2)^a(n-1).
- "Fibonacci-digits": start with "11", append sum of first 2 digits to the preceding number, drop first digit.A093099
"Fibonacci-digits": start with "11", append sum of first 2 digits to the preceding number, drop first digit.
- "Lucas-digits": start with "13", append sum of first 2 digits to the preceding number, drop first digit.A093100
"Lucas-digits": start with "13", append sum of first 2 digits to the preceding number, drop first digit.
- Cancellation factor in reducing Sum_{k=0...n} 1/k! to lowest terms.A093101
Cancellation factor in reducing Sum_{k=0...n} 1/k! to lowest terms.
- An "L" digit is a digit "looking to the Left" (1,2,3,7,9); an "R" digit is a digit "looking to the Right" (4,5,6); an "U" digit is a digit "looking at Us" (0,8). This is the slowest increasing sequence showing the infinite pattern [LR] (when read digit-by-digit).A093102
An "L" digit is a digit "looking to the Left" (1,2,3,7,9); an "R" digit is a digit "looking to the Right" (4,5,6); an "U" digit is a digit "looking at Us" (0,8). This is the slowest increasing sequence showing the infinite pattern [LR] (when read digit-by-digit).
- a(n+2) = 8*a(n+1) + 21*a(n), with a(1)=1, a(2)=8.A093103
a(n+2) = 8*a(n+1) + 21*a(n), with a(1)=1, a(2)=8.
- An "L" digit is a digit "looking to the Left" (1,2,3,7,9); an "R" digit is a digit "looking to the Right" (4,5,6); an "U" digit is a digit "looking at Us" (0,8). This is the slowest increasing sequence showing the infinite pattern [LUR] (when read digit-by-digit).A093104
An "L" digit is a digit "looking to the Left" (1,2,3,7,9); an "R" digit is a digit "looking to the Right" (4,5,6); an "U" digit is a digit "looking at Us" (0,8). This is the slowest increasing sequence showing the infinite pattern [LUR] (when read digit-by-digit).
- An "L" digit is a digit "looking to the Left" (1,2,3,7,9); an "R" digit is a digit "looking to the Right" (4,5,6); an "U" digit is a digit "looking at Us" (0,8). This is the slowest increasing sequence showing the infinite pattern [URL] (when read digit-by-digit).A093105
An "L" digit is a digit "looking to the Left" (1,2,3,7,9); an "R" digit is a digit "looking to the Right" (4,5,6); an "U" digit is a digit "looking at Us" (0,8). This is the slowest increasing sequence showing the infinite pattern [URL] (when read digit-by-digit).
- Numbers k such that the k-th cyclotomic polynomial evaluated at 2 (=A019320(k)) is not coprime to k.A093106
Numbers k such that the k-th cyclotomic polynomial evaluated at 2 (=A019320(k)) is not coprime to k.
- Numbers n such that the Zsigmondy number Zs(n,3,1) differs from the n-th cyclotomic polynomial evaluated at 3.A093107
Numbers n such that the Zsigmondy number Zs(n,3,1) differs from the n-th cyclotomic polynomial evaluated at 3.
- Numbers n such that the Zsigmondy number Zs(n,4,1) differs from the n-th cyclotomic polynomial evaluated at 4.A093108
Numbers n such that the Zsigmondy number Zs(n,4,1) differs from the n-th cyclotomic polynomial evaluated at 4.
- Numbers n such that the Zsigmondy number Zs(n,5,1) differs from the n-th cyclotomic polynomial evaluated at 5.A093109
Numbers n such that the Zsigmondy number Zs(n,5,1) differs from the n-th cyclotomic polynomial evaluated at 5.
- Numbers that can be written as a sum of three elements from A051912.A093110
Numbers that can be written as a sum of three elements from A051912.