Sequences
392,541 sequences
- a(n) = floor(n/10) - 5*(n mod 10).A076311
a(n) = floor(n/10) - 5*(n mod 10).
- a(n) = floor(n/10) + 2*(n mod 10).A076312
a(n) = floor(n/10) + 2*(n mod 10).
- a(n) = floor(n/10) - (n mod 10).A076313
a(n) = floor(n/10) - (n mod 10).
- a(n) = floor(n/10) + (n mod 10).A076314
a(n) = floor(n/10) + (n mod 10).
- Number of 3-colorable (i.e., chromatic number <= 3) simple graphs on n nodes.A076315
Number of 3-colorable (i.e., chromatic number <= 3) simple graphs on n nodes.
- Number of 4-colorable (i.e., chromatic number <= 4) simple graphs on n nodes.A076316
Number of 4-colorable (i.e., chromatic number <= 4) simple graphs on n nodes.
- Number of 5-colorable (i.e., chromatic number <= 5) simple graphs on n nodes.A076317
Number of 5-colorable (i.e., chromatic number <= 5) simple graphs on n nodes.
- Number of 6-colorable (i.e., chromatic number <= 6) simple graphs on n nodes.A076318
Number of 6-colorable (i.e., chromatic number <= 6) simple graphs on n nodes.
- Number of 7-colorable (i.e., chromatic number <= 7) simple graphs on n nodes.A076319
Number of 7-colorable (i.e., chromatic number <= 7) simple graphs on n nodes.
- Number of 8-colorable (i.e., chromatic number <= 8) simple graphs on n nodes.A076320
Number of 8-colorable (i.e., chromatic number <= 8) simple graphs on n nodes.
- Number of 9-colorable (i.e., chromatic number <= 9) simple graphs on n nodes.A076321
Number of 9-colorable (i.e., chromatic number <= 9) simple graphs on n nodes.
- Number of connected 3-colorable (i.e., chromatic number <= 3) simple graphs on n nodes.A076322
Number of connected 3-colorable (i.e., chromatic number <= 3) simple graphs on n nodes.
- Number of connected 4-colorable (i.e., chromatic number <= 4) simple graphs on n nodes.A076323
Number of connected 4-colorable (i.e., chromatic number <= 4) simple graphs on n nodes.
- Number of connected 5-colorable (i.e., chromatic number <= 5) simple graphs on n nodes.A076324
Number of connected 5-colorable (i.e., chromatic number <= 5) simple graphs on n nodes.
- Number of connected 6-colorable (i.e., chromatic number <= 6) simple graphs on n nodes.A076325
Number of connected 6-colorable (i.e., chromatic number <= 6) simple graphs on n nodes.
- Number of connected 7-colorable (i.e., chromatic number <= 7) simple graphs on n nodes.A076326
Number of connected 7-colorable (i.e., chromatic number <= 7) simple graphs on n nodes.
- Number of connected 8-colorable (i.e., chromatic number <= 8) simple graphs on n nodes.A076327
Number of connected 8-colorable (i.e., chromatic number <= 8) simple graphs on n nodes.
- Number of connected 9-colorable (i.e., chromatic number <= 9) simple graphs on n nodes.A076328
Number of connected 9-colorable (i.e., chromatic number <= 9) simple graphs on n nodes.
- Numbers k for which rank of the elliptic curve y^2=x^3+k*x is 2.A076329
Numbers k for which rank of the elliptic curve y^2=x^3+k*x is 2.
- Elliptic curves (see reference for precise definition).A076330
Elliptic curves (see reference for precise definition).
- Elliptic curves (see reference for precise definition).A076331
Elliptic curves (see reference for precise definition).
- a(n) = rad(n) + n/rad(n), where rad(n) is the squarefree kernel of n = A007947(n).A076332
a(n) = rad(n) + n/rad(n), where rad(n) is the squarefree kernel of n = A007947(n).
- Squarefree kernels of nonsquarefree numbers.A076333
Squarefree kernels of nonsquarefree numbers.
- Differences between successive squarefree kernels.A076334
Differences between successive squarefree kernels.
- Brier numbers: numbers that are both Riesel and Sierpiński [Sierpinski], or odd n such that for all k >= 1 the numbers n*2^k + 1 and n*2^k - 1 are composite.A076335
Brier numbers: numbers that are both Riesel and Sierpiński [Sierpinski], or odd n such that for all k >= 1 the numbers n*2^k + 1 and n*2^k - 1 are composite.
- (Provable) Sierpiński numbers: odd numbers n such that for all k >= 1 the numbers n*2^k + 1 are composite.A076336
(Provable) Sierpiński numbers: odd numbers n such that for all k >= 1 the numbers n*2^k + 1 are composite.
- Riesel numbers: odd numbers n such that for all k >= 1 the numbers n*2^k - 1 are composite.A076337
Riesel numbers: odd numbers n such that for all k >= 1 the numbers n*2^k - 1 are composite.
- a(n) = 512*n + 1.A076338
a(n) = 512*n + 1.
- Primes of the form 512*k+1.A076339
Primes of the form 512*k+1.
- Real part of the function defined multiplicatively on the complex numbers by 2->(2,0) and p->((floor(p/4)+floor((p mod 4)/2))*4,2-(p mod 4)) for odd primes p.A076340
Real part of the function defined multiplicatively on the complex numbers by 2->(2,0) and p->((floor(p/4)+floor((p mod 4)/2))*4,2-(p mod 4)) for odd primes p.
- Imaginary part of the function defined multiplicatively on the complex numbers by 2->(2,0) and p->((floor(p/4)+floor((p mod 4)/2))*4,2-(p mod 4)) for odd primes p.A076341
Imaginary part of the function defined multiplicatively on the complex numbers by 2->(2,0) and p->((floor(p/4)+floor((p mod 4)/2))*4,2-(p mod 4)) for odd primes p.
- a(n) = A076340(A000040(n)), real part of primes mapped as defined in A076340, A076341.A076342
a(n) = A076340(A000040(n)), real part of primes mapped as defined in A076340, A076341.
- A076340(A001358(n)), real part of semiprimes mapped as defined in A076340, A076341.A076343
A076340(A001358(n)), real part of semiprimes mapped as defined in A076340, A076341.
- A076341(A001358(n)), imaginary part of semiprimes mapped as defined in A076340, A076341.A076344
A076341(A001358(n)), imaginary part of semiprimes mapped as defined in A076340, A076341.
- A076340(A000961(n)), real part of prime powers mapped as defined in A076340, A076341.A076345
A076340(A000961(n)), real part of prime powers mapped as defined in A076340, A076341.
- A076341(A000961(n)), imaginary part of prime powers mapped as defined in A076340, A076341.A076346
A076341(A000961(n)), imaginary part of prime powers mapped as defined in A076340, A076341.
- A076340(A005117(n)), real part of squarefree numbers mapped as defined in A076340, A076341.A076347
A076340(A005117(n)), real part of squarefree numbers mapped as defined in A076340, A076341.
- A076341(A005117(n)), imaginary part of squarefree numbers mapped as defined in A076340, A076341.A076348
A076341(A005117(n)), imaginary part of squarefree numbers mapped as defined in A076340, A076341.
- A076340(A000290(n)), real part of squares mapped as defined in A076340, A076341.A076349
A076340(A000290(n)), real part of squares mapped as defined in A076340, A076341.
- A076341(A000290(n)), imaginary part of squares mapped as defined in A076340, A076341.A076350
A076341(A000290(n)), imaginary part of squares mapped as defined in A076340, A076341.
- Numbers n such that A076341(n)=0.A076351
Numbers n such that A076341(n)=0.
- Squarefree numbers k such that A076341(k) = 0.A076352
Squarefree numbers k such that A076341(k) = 0.
- Numbers n such that Sum_{k=1..n} d(k) is an integer, where d(k) is the decimal fraction 0.floor(sqrt(k)) (e.g. d(16)=0.4).A076353
Numbers n such that Sum_{k=1..n} d(k) is an integer, where d(k) is the decimal fraction 0.floor(sqrt(k)) (e.g. d(16)=0.4).
- Numbers n such that 210*n-1 is prime.A076354
Numbers n such that 210*n-1 is prime.
- Numbers n such that 210*n + 11 is prime.A076355
Numbers n such that 210*n + 11 is prime.
- Numbers n such that 210*n-11 is prime.A076356
Numbers n such that 210*n-11 is prime.
- a(n) = floor(t^n) where t = 39661481813^(1/10) (approximately 11.4772).A076357
a(n) = floor(t^n) where t = 39661481813^(1/10) (approximately 11.4772).
- a(n) = numerator(n!/phi(n!)).A076358
a(n) = numerator(n!/phi(n!)).
- a(n) = denominator(n!/phi(n!)).A076359
a(n) = denominator(n!/phi(n!)).
- a(n) = d(sigma(n)) - sigma(d(n)), where d(n) is the number of divisors of n and sigma(n) is their sum.A076360
a(n) = d(sigma(n)) - sigma(d(n)), where d(n) is the number of divisors of n and sigma(n) is their sum.