Sequences
392,541 sequences
- A095259(A095259(n)).A095261
A095259(A095259(n)).
- A sequence derived from a truncated Pascal's Triangle matrix.A095262
A sequence derived from a truncated Pascal's Triangle matrix.
- a(n+3) = 3*a(n+2) - 2*a(n+1) + a(n).A095263
a(n+3) = 3*a(n+2) - 2*a(n+1) + a(n).
- a(n) = 2^(n+2) - 3*n - 4.A095264
a(n) = 2^(n+2) - 3*n - 4.
- A sequence generated from a 4th degree Pascal's Triangle polynomial.A095265
A sequence generated from a 4th degree Pascal's Triangle polynomial.
- A sequence generated from the Narayana triangle considered as a matrix, or from Pascal's triangle.A095266
A sequence generated from the Narayana triangle considered as a matrix, or from Pascal's triangle.
- Least perimeter common to 2^n primitive arithmetic triangles, i.e., Heronian triangles whose sides are in arithmetic progression.A095267
Least perimeter common to 2^n primitive arithmetic triangles, i.e., Heronian triangles whose sides are in arithmetic progression.
- Number of distinct degree sequences among all n-vertex graphs with no isolated vertices.A095268
Number of distinct degree sequences among all n-vertex graphs with no isolated vertices.
- Diving index of 4n+3.A095269
Diving index of 4n+3.
- Length of maximal Motzkin path prefix in the Jacobi-vector of 4n+3.A095270
Length of maximal Motzkin path prefix in the Jacobi-vector of 4n+3.
- Diving index of A095101(n).A095271
Diving index of A095101(n).
- a(n) = (A095102(n)-3)/4.A095272
a(n) = (A095102(n)-3)/4.
- a(n) = (A095103(n)-3)/4.A095273
a(n) = (A095103(n)-3)/4.
- a(n) = (A095100(n)-3)/4.A095274
a(n) = (A095100(n)-3)/4.
- a(n) = (A095101(n)-3)/4.A095275
a(n) = (A095101(n)-3)/4.
- Length of n-th run of identical symbols in A095076 and A095111.A095276
Length of n-th run of identical symbols in A095076 and A095111.
- Numbers k such that 4k + 3 is composite.A095277
Numbers k such that 4k + 3 is composite.
- Numbers k such that 4k + 3 is prime.A095278
Numbers k such that 4k + 3 is prime.
- Partial sums of A095276.A095279
Partial sums of A095276.
- Lower Wythoff primes, i.e., primes in A000201.A095280
Lower Wythoff primes, i.e., primes in A000201.
- Upper Wythoff primes, i.e., primes in A001950.A095281
Upper Wythoff primes, i.e., primes in A001950.
- Primes whose binary-expansion ends with an even number of 1's.A095282
Primes whose binary-expansion ends with an even number of 1's.
- Primes whose binary-expansion ends with an odd number of 1's.A095283
Primes whose binary-expansion ends with an odd number of 1's.
- Primes in whose binary expansion the number of 1 bits is > 5 + number of 0 bits.A095284
Primes in whose binary expansion the number of 1 bits is > 5 + number of 0 bits.
- Primes in whose binary expansion the number of 1 bits is <= 5 + number of 0 bits.A095285
Primes in whose binary expansion the number of 1 bits is <= 5 + number of 0 bits.
- Primes in whose binary expansion the number of 1 bits is > 1 + number of 0 bits.A095286
Primes in whose binary expansion the number of 1 bits is > 1 + number of 0 bits.
- Primes in whose binary expansion the number of 1-bits is <= 1 + number of 0-bits.A095287
Primes in whose binary expansion the number of 1-bits is <= 1 + number of 0-bits.
- Least middle side of 2^n primitive arithmetic triangles, i.e., primitive Heronian triangles whose sides are in arithmetic progression.A095288
Least middle side of 2^n primitive arithmetic triangles, i.e., primitive Heronian triangles whose sides are in arithmetic progression.
- a(n) = the smallest number (in base 10) such that the product of its digits is >= n.A095289
a(n) = the smallest number (in base 10) such that the product of its digits is >= n.
- Number of lower Wythoff primes (A095280) in range ]2^n,2^(n+1)].A095290
Number of lower Wythoff primes (A095280) in range ]2^n,2^(n+1)].
- Number of upper Wythoff primes (A095281) in range ]2^n,2^(n+1)].A095291
Number of upper Wythoff primes (A095281) in range ]2^n,2^(n+1)].
- Number of A095282-primes in range ]2^n,2^(n+1)].A095292
Number of A095282-primes in range ]2^n,2^(n+1)].
- Number of A095283-primes in range ]2^n,2^(n+1)].A095293
Number of A095283-primes in range ]2^n,2^(n+1)].
- Number of A095284-primes in range ]2^n,2^(n+1)].A095294
Number of A095284-primes in range ]2^n,2^(n+1)].
- Number of A095285-primes in range ]2^n,2^(n+1)].A095295
Number of A095285-primes in range ]2^n,2^(n+1)].
- Number of A095286-primes in range ]2^n,2^(n+1)].A095296
Number of A095286-primes in range ]2^n,2^(n+1)].
- Number of A095287-primes in range ]2^n,2^(n+1)].A095297
Number of A095287-primes in range ]2^n,2^(n+1)].
- Sum of 1-bits between the most and least significant bits summed for all primes in range ]2^n,2^(n+1)].A095298
Sum of 1-bits between the most and least significant bits summed for all primes in range ]2^n,2^(n+1)].
- Numbers n such that A094757(n) < n.A095299
Numbers n such that A094757(n) < n.
- Numbers k such that A094758(k) < k.A095300
Numbers k such that A094758(k) < k.
- Numbers n such that there is some k < n with n*sigma(k) = k*sigma(n).A095301
Numbers n such that there is some k < n with n*sigma(k) = k*sigma(n).
- Smallest prime of the form k^n+2 with k>1.A095302
Smallest prime of the form k^n+2 with k>1.
- Smallest number k such that k^n - 2 is prime.A095303
Smallest number k such that k^n - 2 is prime.
- Smallest prime of the form k^n-2.A095304
Smallest prime of the form k^n-2.
- Numbers k such that A094020(k) < k.A095305
Numbers k such that A094020(k) < k.
- Numbers n such that r(k) * 2^n + 1 is prime, where r() = A002275 the repunits and k is the number of decimal digits of 2^n.A095306
Numbers n such that r(k) * 2^n + 1 is prime, where r() = A002275 the repunits and k is the number of decimal digits of 2^n.
- Number of walks of length n between two nodes at distance 2 in the cycle graph C_7.A095307
Number of walks of length n between two nodes at distance 2 in the cycle graph C_7.
- Number of walks of length n between two nodes at distance 3 in the cycle graph C_7.A095308
Number of walks of length n between two nodes at distance 3 in the cycle graph C_7.
- Numbers such that both their binary and Zeckendorf representations are palindromic.A095309
Numbers such that both their binary and Zeckendorf representations are palindromic.
- a(n+3) = 2*a(n+2) + 3*(n+1) - a(n).A095310
a(n+3) = 2*a(n+2) + 3*(n+1) - a(n).