Sequences
392,541 sequences
- Decimal expansion of A064582/2, i.e., real part of omega_1 in the equianharmonic case.A094961
Decimal expansion of A064582/2, i.e., real part of omega_1 in the equianharmonic case.
- Decimal expansion of A064582*sqrt(3)/2, i.e., imaginary part of omega_1 in the equianharmonic case.A094962
Decimal expansion of A064582*sqrt(3)/2, i.e., imaginary part of omega_1 in the equianharmonic case.
- Numbers k such that 2^k - 3*k is prime.A094963
Numbers k such that 2^k - 3*k is prime.
- A continued fraction transformation of Pi.A094964
A continued fraction transformation of Pi.
- A continued fraction transformation of e.A094965
A continued fraction transformation of e.
- Left-hand neighbors of Fibonacci numbers in Stern's diatomic series.A094966
Left-hand neighbors of Fibonacci numbers in Stern's diatomic series.
- Right-hand neighbors of Fibonacci numbers in Stern's diatomic series.A094967
Right-hand neighbors of Fibonacci numbers in Stern's diatomic series.
- Indices of Fibonacci numbers in Stern's diatomic series A049456 regarded as a single linear sequence.A094968
Indices of Fibonacci numbers in Stern's diatomic series A049456 regarded as a single linear sequence.
- a(n) = floor(5^n/2^n).A094969
a(n) = floor(5^n/2^n).
- a(n) = floor(7^n/2^n).A094970
a(n) = floor(7^n/2^n).
- a(n) = floor(9^n/2^n).A094971
a(n) = floor(9^n/2^n).
- a(n) = floor(11^n/2^n).A094972
a(n) = floor(11^n/2^n).
- Square numbers which equal a triangular number times an odd number between 1 and 15.A094973
Square numbers which equal a triangular number times an odd number between 1 and 15.
- a(n) = floor(5^n/3^n).A094974
a(n) = floor(5^n/3^n).
- a(n) = floor(7^n/3^n).A094975
a(n) = floor(7^n/3^n).
- a(n) = floor(8^n/3^n).A094976
a(n) = floor(8^n/3^n).
- a(n) = floor(10^n/3^n).A094977
a(n) = floor(10^n/3^n).
- a(n) = floor(11^n/3^n).A094978
a(n) = floor(11^n/3^n).
- Duplicate of A065565.A094979
Duplicate of A065565.
- a(n) = floor(7^n/4^n).A094980
a(n) = floor(7^n/4^n).
- a(n) = floor(9^n/4^n).A094981
a(n) = floor(9^n/4^n).
- a(n) = floor(11^n/4^n).A094982
a(n) = floor(11^n/4^n).
- a(n) = floor(6^n/5^n).A094983
a(n) = floor(6^n/5^n).
- a(n) = floor(7^n/5^n).A094984
a(n) = floor(7^n/5^n).
- a(n) = floor(8^n/5^n).A094985
a(n) = floor(8^n/5^n).
- a(n) = floor(9^n/5^n).A094986
a(n) = floor(9^n/5^n).
- a(n) = floor(11^n/5^n).A094987
a(n) = floor(11^n/5^n).
- a(n) = floor(7^n/6^n).A094988
a(n) = floor(7^n/6^n).
- a(n) = floor(11^n/6^n).A094989
a(n) = floor(11^n/6^n).
- a(n) = floor(8^n/7^n).A094990
a(n) = floor(8^n/7^n).
- a(n) = floor(9^n/7^n).A094991
a(n) = floor(9^n/7^n).
- a(n) = floor(10^n/7^n).A094992
a(n) = floor(10^n/7^n).
- a(n) = floor(11^n/7^n).A094993
a(n) = floor(11^n/7^n).
- a(n) = floor(9^n/8^n).A094994
a(n) = floor(9^n/8^n).
- a(n) = floor(11^n/8^n).A094995
a(n) = floor(11^n/8^n).
- a(n) = floor(10^n/9^n).A094996
a(n) = floor(10^n/9^n).
- a(n) = floor(11^n/9^n).A094997
a(n) = floor(11^n/9^n).
- a(n) is smallest positive integer multiple of n-th prime, say k*prime(n), such that k*prime(n) == 1 (mod j) for each integer j with 1 < j < prime(n).A094998
a(n) is smallest positive integer multiple of n-th prime, say k*prime(n), such that k*prime(n) == 1 (mod j) for each integer j with 1 < j < prime(n).
- a(n) = floor(12^n/11^n).A094999
a(n) = floor(12^n/11^n).
- E.g.f.: exp(x)/(1-x)^4.A095000
E.g.f.: exp(x)/(1-x)^4.
- a(n) = Sum_{d|n} rad(d)^(n/d), where rad(d) = A007947(d) is the squarefree kernel of d.A095001
a(n) = Sum_{d|n} rad(d)^(n/d), where rad(d) = A007947(d) is the squarefree kernel of d.
- a(n) = 9*a(n-1) - 9*a(n-2) + a(n-3); given a(1) = 1, a(2) = 3, a(3) = 19.A095002
a(n) = 9*a(n-1) - 9*a(n-2) + a(n-3); given a(1) = 1, a(2) = 3, a(3) = 19.
- a(n) = 9*a(n-1) - 9*a(n-2) + a(n-3).A095003
a(n) = 9*a(n-1) - 9*a(n-2) + a(n-3).
- a(n) = 9*a(n-1) - 9*a(n-2) + a(n-3); given a(1) = 1, a(2) = 10, a(3) = 81.A095004
a(n) = 9*a(n-1) - 9*a(n-2) + a(n-3); given a(1) = 1, a(2) = 10, a(3) = 81.
- Number of odious primes (A027697) in range ]2^n,2^(n+1)].A095005
Number of odious primes (A027697) in range ]2^n,2^(n+1)].
- Number of evil primes (A027699) in range ]2^n,2^(n+1)].A095006
Number of evil primes (A027699) in range ]2^n,2^(n+1)].
- Number of 4k+1 primes (A002144) in range ]2^n,2^(n+1)].A095007
Number of 4k+1 primes (A002144) in range ]2^n,2^(n+1)].
- Number of 4k+3 primes (A002145) in range ]2^n,2^(n+1)].A095008
Number of 4k+3 primes (A002145) in range ]2^n,2^(n+1)].
- Number of 8k+1 primes (A007519) in range ]2^n,2^(n+1)].A095009
Number of 8k+1 primes (A007519) in range ]2^n,2^(n+1)].
- Number of 8k+3 primes (A007520) in range [2^n,2^(n+1)].A095010
Number of 8k+3 primes (A007520) in range [2^n,2^(n+1)].