Sequences
392,541 sequences
- Even and odd solutions to abs(sigma(x)-2x) <= log(x). Numbers n whose abundance-radius does not exceed log(n).A088011
Even and odd solutions to abs(sigma(x)-2x) <= log(x). Numbers n whose abundance-radius does not exceed log(n).
- Odd solutions to abs(sigma(k) - 2k) <= log(k). Numbers k whose abundance-radius does not exceed log(k).A088012
Odd solutions to abs(sigma(k) - 2k) <= log(k). Numbers k whose abundance-radius does not exceed log(k).
- Binomial transform of A001541 (with interpolated zeros).A088013
Binomial transform of A001541 (with interpolated zeros).
- Expansion of e.g.f.: cosh(sqrt(2)*x)*(1+exp(x)).A088014
Expansion of e.g.f.: cosh(sqrt(2)*x)*(1+exp(x)).
- Expansion of e.g.f. cosh(sqrt(2)*x) + exp(x)*(cosh(sqrt(2)*x) - 1).A088015
Expansion of e.g.f. cosh(sqrt(2)*x) + exp(x)*(cosh(sqrt(2)*x) - 1).
- To obtain a(n+1), add the square of the n-th partial sum to the n-th partial sum of the squares, then divide this result by a(n), for all n >= 0, with a(0)=1.A088016
To obtain a(n+1), add the square of the n-th partial sum to the n-th partial sum of the squares, then divide this result by a(n), for all n >= 0, with a(0)=1.
- Numbers not expressible as sum or difference of a nonzero cube and a nonzero square.A088017
Numbers not expressible as sum or difference of a nonzero cube and a nonzero square.
- Number of twin-prime pairs between n and 2n (inclusive).A088018
Number of twin-prime pairs between n and 2n (inclusive).
- Number of twin primes between n and 2n (inclusive).A088019
Number of twin primes between n and 2n (inclusive).
- a(n) = (n^2)!.A088020
a(n) = (n^2)!.
- a(n) = (n^2)!/(n!)^2.A088021
a(n) = (n^2)!/(n!)^2.
- a(n) = floor(sum_{k>=0} k^n /(k!)^3); related to generalized Bell numbers.A088022
a(n) = floor(sum_{k>=0} k^n /(k!)^3); related to generalized Bell numbers.
- Set a(1) = 1. Then take the list of defined initial terms, reverse their order, add 1, 2, 3, ... to the reversed list in succession and append this new list to the right of the previously defined terms. Repeat this process indefinitely.A088023
Set a(1) = 1. Then take the list of defined initial terms, reverse their order, add 1, 2, 3, ... to the reversed list in succession and append this new list to the right of the previously defined terms. Repeat this process indefinitely.
- Erroneous version of A122547.A088024
Erroneous version of A122547.
- Erroneous version of A014577.A088025
Erroneous version of A014577.
- Number of "sets of even lists" for even n, cf. A000262.A088026
Number of "sets of even lists" for even n, cf. A000262.
- Smallest square k such that k-1 is a squarefree number with n prime divisors.A088027
Smallest square k such that k-1 is a squarefree number with n prime divisors.
- Smallest k such that k^2-1 is a squarefree number with n prime divisors. a(n) = A088027(n)^(1/2).A088028
Smallest k such that k^2-1 is a squarefree number with n prime divisors. a(n) = A088027(n)^(1/2).
- Smallest cube k such that k-1 is a squarefree number with n prime divisors.A088029
Smallest cube k such that k-1 is a squarefree number with n prime divisors.
- Smallest k such that k^3 -1 is a squarefree number with n prime divisors. a(n) = A088029(n)^(1/3).A088030
Smallest k such that k^3 -1 is a squarefree number with n prime divisors. a(n) = A088029(n)^(1/3).
- Smallest n-th power k such that k-1 is divisible by an n-th power. Smallest n-th power == 1 (mod some n-th power).A088031
Smallest n-th power k such that k-1 is divisible by an n-th power. Smallest n-th power == 1 (mod some n-th power).
- Smallest number k such that k^n -1 is divisible by an n-th power. a(n) = A088031(n)^(1/n).A088032
Smallest number k such that k^n -1 is divisible by an n-th power. a(n) = A088031(n)^(1/n).
- Even squares k such that k-1 is divisible by a square > 1.A088033
Even squares k such that k-1 is divisible by a square > 1.
- Even numbers k such that k^2-1 is divisible by a square > 1.A088034
Even numbers k such that k^2-1 is divisible by a square > 1.
- Cubes k such that k-1 is divisible by a cube >1.A088035
Cubes k such that k-1 is divisible by a cube >1.
- Numbers k such that k^3 - 1 is divisible by a cube other than 1.A088036
Numbers k such that k^3 - 1 is divisible by a cube other than 1.
- Smallest square k == 1 (mod some n-th power), k > 1.A088037
Smallest square k == 1 (mod some n-th power), k > 1.
- Smallest cube k == 1 (mod some n-th power), k > 1.A088038
Smallest cube k == 1 (mod some n-th power), k > 1.
- Smallest k such that k^3 == 1 (mod some n-th power), k > 1.A088039
Smallest k such that k^3 == 1 (mod some n-th power), k > 1.
- Smallest fourth power k such that k-1 is divisible by an n-th power, k > 1.A088040
Smallest fourth power k such that k-1 is divisible by an n-th power, k > 1.
- Smallest k such that k^4 - 1 is divisible by an n-th power, k > 1.A088041
Smallest k such that k^4 - 1 is divisible by an n-th power, k > 1.
- Number of permutations in the symmetric group S_n such that the size of their conjugacy class is odd.A088042
Number of permutations in the symmetric group S_n such that the size of their conjugacy class is odd.
- Number of partitions of n into parts which can be arranged to form a geometric progression (possibly with a common ratio of 1). (For every partition there exists a geometric progression in which this partition fits in as successive terms.).A088043
Number of partitions of n into parts which can be arranged to form a geometric progression (possibly with a common ratio of 1). (For every partition there exists a geometric progression in which this partition fits in as successive terms.).
- Number of partitions of n with distinct prime signatures.A088044
Number of partitions of n with distinct prime signatures.
- Smallest k such that A088044(k) = n, or 0 if no such k exists.A088045
Smallest k such that A088044(k) = n, or 0 if no such k exists.
- Smallest prime(k) such that prime(k)-prime(j) == 0 (mod prime(n)), for some k > j > n.A088046
Smallest prime(k) such that prime(k)-prime(j) == 0 (mod prime(n)), for some k > j > n.
- Smallest prime(k) such that prime(k) - prime(j) == 0 (mod prime(n)), for some j < k.A088047
Smallest prime(k) such that prime(k) - prime(j) == 0 (mod prime(n)), for some j < k.
- Let S(k) be the set of absolute differences of pairs of primes <= k. a(n) is the least k such that S(k) contains all residues mod prime(n).A088048
Let S(k) be the set of absolute differences of pairs of primes <= k. a(n) is the least k such that S(k) contains all residues mod prime(n).
- Beginning with 1 palindromes with prime successive differences.A088049
Beginning with 1 palindromes with prime successive differences.
- Primes arising as successive differences in A088049. a(n) = A088049(n+1)-A088049(n).A088050
Primes arising as successive differences in A088049. a(n) = A088049(n+1)-A088049(n).
- Primes in A088049.A088051
Primes in A088049.
- Beginning with 1, palindromes such that successive differences are distinct primes.A088052
Beginning with 1, palindromes such that successive differences are distinct primes.
- Primes arising as the successive difference of terms of A088052. a(n) = A088052(n+1)-A088052(n).A088053
Primes arising as the successive difference of terms of A088052. a(n) = A088052(n+1)-A088052(n).
- Factorial primes: primes which are within 1 of a factorial number.A088054
Factorial primes: primes which are within 1 of a factorial number.
- a(n) = n!*n^n - ((n^(n+1)-1)/(n-1) - 1) for n>1 with a(1)=0.A088055
a(n) = n!*n^n - ((n^(n+1)-1)/(n-1) - 1) for n>1 with a(1)=0.
- a(1)= 3, a(n) = least prime obtained by prefixing the digits of a multiple of n to a(n-1).A088056
a(1)= 3, a(n) = least prime obtained by prefixing the digits of a multiple of n to a(n-1).
- a(1)= 7, a(n) = least prime obtained by prefixing the digits of a multiple of n to a(n-1).A088057
a(1)= 7, a(n) = least prime obtained by prefixing the digits of a multiple of n to a(n-1).
- Duplicate of A062392.A088058
Duplicate of A062392.
- Duplicate of A028387.A088059
Duplicate of A028387.
- For each Fibonacci number F(m) = A000045(m), m >= 1, look for the smallest Fibonacci number F(k) > F(m) such that F(m) + F(k) is a square. If it exists, append F(k) to the sequence.A088060
For each Fibonacci number F(m) = A000045(m), m >= 1, look for the smallest Fibonacci number F(k) > F(m) such that F(m) + F(k) is a square. If it exists, append F(k) to the sequence.