Sequences
392,541 sequences
- 47-gonal numbers.A095311
47-gonal numbers.
- Primes in whose binary expansion the number of 1-bits is > 6 + number of 0-bits.A095312
Primes in whose binary expansion the number of 1-bits is > 6 + number of 0-bits.
- Primes in whose binary expansion the number of 1-bits is <= 6 + number of 0-bits.A095313
Primes in whose binary expansion the number of 1-bits is <= 6 + number of 0-bits.
- Primes in whose binary expansion the number of 1 bits is > 2 + number of 0 bits.A095314
Primes in whose binary expansion the number of 1 bits is > 2 + number of 0 bits.
- Primes in whose binary expansion the number of 1 bits is <= 2 + number of 0 bits.A095315
Primes in whose binary expansion the number of 1 bits is <= 2 + number of 0 bits.
- Primes in whose binary expansion the number of 1-bits is > number of 0-bits minus 2.A095316
Primes in whose binary expansion the number of 1-bits is > number of 0-bits minus 2.
- Primes in whose binary expansion the number of 1 bits is <= number of 0 bits minus 2.A095317
Primes in whose binary expansion the number of 1 bits is <= number of 0 bits minus 2.
- Primes in whose binary expansion the number of 1 bits is > 3 + number of 0 bits.A095318
Primes in whose binary expansion the number of 1 bits is > 3 + number of 0 bits.
- Primes in whose binary expansion the number of 1 bits is <= 3 + number of 0 bits.A095319
Primes in whose binary expansion the number of 1 bits is <= 3 + number of 0 bits.
- Primes in whose binary expansion the number of 1-bits is > number of 0-bits minus 3.A095320
Primes in whose binary expansion the number of 1-bits is > number of 0-bits minus 3.
- Primes in whose binary expansion the number of 1-bits is <= number of 0-bits minus 3.A095321
Primes in whose binary expansion the number of 1-bits is <= number of 0-bits minus 3.
- Primes in whose binary expansion the number of 1 bits is > 4 + number of 0 bits.A095322
Primes in whose binary expansion the number of 1 bits is > 4 + number of 0 bits.
- Primes in whose binary expansion the number of 1 bits is <= 4 + number of 0 bits.A095323
Primes in whose binary expansion the number of 1 bits is <= 4 + number of 0 bits.
- Number of A095322-primes in range ]2^n,2^(n+1)].A095324
Number of A095322-primes in range ]2^n,2^(n+1)].
- Number of A095323-primes in range ]2^n,2^(n+1)].A095325
Number of A095323-primes in range ]2^n,2^(n+1)].
- Number of A095316-primes in range [2^n,2^(n+1)].A095326
Number of A095316-primes in range [2^n,2^(n+1)].
- Number of A095317-primes in range ]2^n,2^(n+1)].A095327
Number of A095317-primes in range ]2^n,2^(n+1)].
- Number of A095318-primes in range ]2^n,2^(n+1)].A095328
Number of A095318-primes in range ]2^n,2^(n+1)].
- Number of A095319-primes in range ]2^n,2^(n+1)].A095329
Number of A095319-primes in range ]2^n,2^(n+1)].
- Number of A095320-primes in range ]2^n,2^(n+1)].A095330
Number of A095320-primes in range ]2^n,2^(n+1)].
- Number of A095321-primes in range ]2^n,2^(n+1)].A095331
Number of A095321-primes in range ]2^n,2^(n+1)].
- Number of A095312-primes in range ]2^n,2^(n+1)].A095332
Number of A095312-primes in range ]2^n,2^(n+1)].
- Number of A095313-primes in range [2^n,2^(n+1)].A095333
Number of A095313-primes in range [2^n,2^(n+1)].
- Number of A095314-primes in range ]2^n,2^(n+1)].A095334
Number of A095314-primes in range ]2^n,2^(n+1)].
- Number of A095315-primes in range ]2^n,2^(n+1)].A095335
Number of A095315-primes in range ]2^n,2^(n+1)].
- Sum of 1-fibits in Zeckendorf-expansion A014417(p) summed for all primes p in range ]2^n,2^(n+1)].A095336
Sum of 1-fibits in Zeckendorf-expansion A014417(p) summed for all primes p in range ]2^n,2^(n+1)].
- Total number of leaves and degree-1 roots in the rooted trees of order n.A095337
Total number of leaves and degree-1 roots in the rooted trees of order n.
- Total number of leaves in the labeled graphs of order n.A095338
Total number of leaves in the labeled graphs of order n.
- Total number of leaves and roots in the planted trees of order n.A095339
Total number of leaves and roots in the planted trees of order n.
- Total number of nodes in all labeled graphs on n nodes.A095340
Total number of nodes in all labeled graphs on n nodes.
- Total number of nodes in all planted trees on n nodes.A095341
Total number of nodes in all planted trees on n nodes.
- Number of elements in n-th string generated by a Kolakoski(5,1) rule starting with a(1)=1.A095342
Number of elements in n-th string generated by a Kolakoski(5,1) rule starting with a(1)=1.
- Length of n-th string generated by a Kolakoski(7,1) rule starting with a(1)=1.A095343
Length of n-th string generated by a Kolakoski(7,1) rule starting with a(1)=1.
- Length of n-th string generated by a Kolakoski(9,1) rule starting with a(1)=1.A095344
Length of n-th string generated by a Kolakoski(9,1) rule starting with a(1)=1.
- a(n) is the length of the n-th run in A095346.A095345
a(n) is the length of the n-th run in A095346.
- a(n) is the length of the n-th run of A095345.A095346
a(n) is the length of the n-th run of A095345.
- n sets a new record for number of iterations of A034690 (sum of digits of the divisors of n) needed to reach 15 (see A086793).A095347
n sets a new record for number of iterations of A034690 (sum of digits of the divisors of n) needed to reach 15 (see A086793).
- Number of distinct automorphism group orders for the simple graphs on n nodes.A095348
Number of distinct automorphism group orders for the simple graphs on n nodes.
- Total number of edges in all trees on n nodes.A095349
Total number of edges in all trees on n nodes.
- Total number of edges in all rooted trees on n nodes.A095350
Total number of edges in all rooted trees on n nodes.
- Total number of edges in all labeled graphs on n nodes.A095351
Total number of edges in all labeled graphs on n nodes.
- Number of (not necessarily connected) edge-transitive simple graphs on n vertices.A095352
Number of (not necessarily connected) edge-transitive simple graphs on n vertices.
- Sum of 1-fibits in Zeckendorf-expansion A014417(p) summed for all primes p in range [Fib(n+1),Fib(n+2)[ (where Fib = A000045).A095353
Sum of 1-fibits in Zeckendorf-expansion A014417(p) summed for all primes p in range [Fib(n+1),Fib(n+2)[ (where Fib = A000045).
- Number of primes p such that Fib(n+1) <= p < Fib(n+2), (where Fib = A000045).A095354
Number of primes p such that Fib(n+1) <= p < Fib(n+2), (where Fib = A000045).
- Ratio A095106(n)/A095093(n) rounded down.A095355
Ratio A095106(n)/A095093(n) rounded down.
- Ratio A095106(n)/A095093(n) rounded to nearest integer.A095356
Ratio A095106(n)/A095093(n) rounded to nearest integer.
- Ratio A095107(n)/A095008(n) rounded down.A095357
Ratio A095107(n)/A095008(n) rounded down.
- Ratio A095107(n)/A095008(n) rounded to nearest integer.A095358
Ratio A095107(n)/A095008(n) rounded to nearest integer.
- Ratio A095109(n)/A095091(n) rounded down.A095359
Ratio A095109(n)/A095091(n) rounded down.
- Ratio A095109(n)/A095091(n) rounded to nearest integer.A095360
Ratio A095109(n)/A095091(n) rounded to nearest integer.