Sequences
392,541 sequences
- Primes in the sequence of sums of alternating powers of 2.A079361
Primes in the sequence of sums of alternating powers of 2.
- Sequence of sums of alternating powers of 3.A079362
Sequence of sums of alternating powers of 3.
- Primes of the form 2*3^k - 1.A079363
Primes of the form 2*3^k - 1.
- Composite numbers having two composite neighbors.A079364
Composite numbers having two composite neighbors.
- Binary expansion of a Chaitin Omega number Omega_U.A079365
Binary expansion of a Chaitin Omega number Omega_U.
- Costé prime expansion of Pi - 3.A079366
Costé prime expansion of Pi - 3.
- Records in A079366.A079367
Records in A079366.
- Where records occur in A079366.A079368
Where records occur in A079366.
- Costé prime expansion of e - 2.A079369
Costé prime expansion of e - 2.
- Records in A079369.A079370
Records in A079369.
- Where records occur in A079369.A079371
Where records occur in A079369.
- Costé prime expansion of sqrt(2) - 1.A079372
Costé prime expansion of sqrt(2) - 1.
- Records in A079372.A079373
Records in A079372.
- Where records occur in A079372.A079374
Where records occur in A079372.
- Costé prime expansion of Pi^2 - 9.A079375
Costé prime expansion of Pi^2 - 9.
- Records in A079375.A079376
Records in A079375.
- Where records occur in A079375.A079377
Where records occur in A079375.
- Costé prime expansion of (sqrt(5)-1)/2.A079378
Costé prime expansion of (sqrt(5)-1)/2.
- Records in A079378.A079379
Records in A079378.
- Where records occur in A079378.A079380
Where records occur in A079378.
- Costé prime expansion of Euler's constant gamma (A001620).A079381
Costé prime expansion of Euler's constant gamma (A001620).
- Records in A079381.A079382
Records in A079381.
- Where records occur in A079381.A079383
Where records occur in A079381.
- Costé prime expansion of 2^(1/3) - 1.A079384
Costé prime expansion of 2^(1/3) - 1.
- Records in A079384.A079385
Records in A079384.
- Where records occur in A079384.A079386
Where records occur in A079384.
- Costé prime expansion of sqrt(3) - 1.A079387
Costé prime expansion of sqrt(3) - 1.
- Records in A079387.A079388
Records in A079387.
- Where records occur in A079387.A079389
Where records occur in A079387.
- a(n) = lpf(n) * lpf(n+1) * lpf(n+2), where lpf(n) = A020639(n) is the least prime factor of n.A079390
a(n) = lpf(n) * lpf(n+1) * lpf(n+2), where lpf(n) = A020639(n) is the least prime factor of n.
- Number of (simple, undirected, unlabeled, connected) graphs with n vertices which contain no induced subgraph isomorphic to C5 (cycle on 5 vertices), P5 (path on 5 vertices) or complement of P5.A079391
Number of (simple, undirected, unlabeled, connected) graphs with n vertices which contain no induced subgraph isomorphic to C5 (cycle on 5 vertices), P5 (path on 5 vertices) or complement of P5.
- Numbers k such that A000594(k) > 0 (Ramanujan's tau function is positive).A079392
Numbers k such that A000594(k) > 0 (Ramanujan's tau function is positive).
- Numbers for which Ramanujan's tau function is negative.A079393
Numbers for which Ramanujan's tau function is negative.
- Compare t(n) and t(n+1) where t = Ramanujan's tau function (A000594); a(n) = p concatenated with q where p and q are given below.A079394
Compare t(n) and t(n+1) where t = Ramanujan's tau function (A000594); a(n) = p concatenated with q where p and q are given below.
- a(n) = prime(n)^11.A079395
a(n) = prime(n)^11.
- Ramanujan's tau function squared applied to primes.A079396
Ramanujan's tau function squared applied to primes.
- Smallest prime with memory = n.A079397
Smallest prime with memory = n.
- a(0)=0, a(1)=1, a(2)=1, a(3)=1, a(n) = a(n-3) + a(n-4) for n > 3.A079398
a(0)=0, a(1)=1, a(2)=1, a(3)=1, a(n) = a(n-3) + a(n-4) for n > 3.
- Number of dots in Braille representation of n.A079399
Number of dots in Braille representation of n.
- p^11 * A000594(p) as p runs through the primes.A079400
p^11 * A000594(p) as p runs through the primes.
- Partial sums of A079399.A079401
Partial sums of A079399.
- Number of permutations of n^2 distinct integers free of any monotonic increasing or decreasing (n+1)-subsequence.A079402
Number of permutations of n^2 distinct integers free of any monotonic increasing or decreasing (n+1)-subsequence.
- Let G(t) be the set of numbers between 2^(t-1) and 2^t-1, inclusive. There is a unique number a(t) in G(t) so that the denominator of the a(t)-th partial sum of the double harmonic series is divisible by smaller 2-powers than its neighbors.A079403
Let G(t) be the set of numbers between 2^(t-1) and 2^t-1, inclusive. There is a unique number a(t) in G(t) so that the denominator of the a(t)-th partial sum of the double harmonic series is divisible by smaller 2-powers than its neighbors.
- Let G(n) be the set of numbers between 2^(n-1) and 2^n-1, inclusive. There is a unique number m(n) in G(n) so that the denominator of the m(n)-th partial sum of the double harmonic series is divisible by smaller 2-power than that of others in G(n). This power is defined to be a(n).A079404
Let G(n) be the set of numbers between 2^(n-1) and 2^n-1, inclusive. There is a unique number m(n) in G(n) so that the denominator of the m(n)-th partial sum of the double harmonic series is divisible by smaller 2-power than that of others in G(n). This power is defined to be a(n).
- Number of dots in primes in Braille.A079405
Number of dots in primes in Braille.
- Recamán variation: a(1)=1, then a(n)=a(n-1)-n if n is already in the sequence, a(n)=a(n-1)+n otherwise.A079406
Recamán variation: a(1)=1, then a(n)=a(n-1)-n if n is already in the sequence, a(n)=a(n-1)+n otherwise.
- Numbers m such that the least s >= 0 such that Sum_{k=0..m} (k+s)!/C(m,k) is an integer satisfies s = m - 1.A079407
Numbers m such that the least s >= 0 such that Sum_{k=0..m} (k+s)!/C(m,k) is an integer satisfies s = m - 1.
- Array T(m,n) (m>=0, n>=0) read by antidiagonals: T(0, 0) = 1, T(0, n) = 0 if n != 0, T(m, n) = T(m-1, T(m-1, n)) + T(m-1, n - T(m-1, n-1)) if m > 0.A079408
Array T(m,n) (m>=0, n>=0) read by antidiagonals: T(0, 0) = 1, T(0, n) = 0 if n != 0, T(m, n) = T(m-1, T(m-1, n)) + T(m-1, n - T(m-1, n-1)) if m > 0.
- Array T(m,n) (m>=0, n>=0) read by antidiagonals: T(0, 0) = 1, T(0, n) = 0 if n > 0, T(m, n) = T(m-1, n - T(m-1, n)) + T(m-1, n - T(m-1, n-1)) if m > 0.A079409
Array T(m,n) (m>=0, n>=0) read by antidiagonals: T(0, 0) = 1, T(0, n) = 0 if n > 0, T(m, n) = T(m-1, n - T(m-1, n)) + T(m-1, n - T(m-1, n-1)) if m > 0.
- Number of ways to lace a shoe that has n pairs of eyelets such that the lace does not cross itself between the eyelet rows.A079410
Number of ways to lace a shoe that has n pairs of eyelets such that the lace does not cross itself between the eyelet rows.