Sequences
392,541 sequences
- a(n) = floor( 1/( {n/phi}-{n/phi}^2 ) )-1, where {} is the fractional part and phi the golden ratio.A089961
a(n) = floor( 1/( {n/phi}-{n/phi}^2 ) )-1, where {} is the fractional part and phi the golden ratio.
- Triangle, read by rows, that equals the matrix inverse of A071207 when treated as a lower triangular matrix.A089962
Triangle, read by rows, that equals the matrix inverse of A071207 when treated as a lower triangular matrix.
- a(n) = Taylor coefficient at x=li(e) of the inverse of the function li(x) (the logarithm integral) multiplied by exp(n).A089963
a(n) = Taylor coefficient at x=li(e) of the inverse of the function li(x) (the logarithm integral) multiplied by exp(n).
- Numbers k such that the denominator of Sum_{j=1..k} mu(j)/j equals Product_{prime p<=k} p.A089964
Numbers k such that the denominator of Sum_{j=1..k} mu(j)/j equals Product_{prime p<=k} p.
- Both n + 1 and n/2 + 1 are primes.A089965
Both n + 1 and n/2 + 1 are primes.
- Numbers n such that omega(n) = gpf(n) mod spf(n), where omega=A001221, gpf=A006530 and spf=A020639.A089966
Numbers n such that omega(n) = gpf(n) mod spf(n), where omega=A001221, gpf=A006530 and spf=A020639.
- Numbers n such that Omega(n) = gpf(n) mod spf(n), where Omega=A001222, gpf=A006530 and spf=A020639.A089967
Numbers n such that Omega(n) = gpf(n) mod spf(n), where Omega=A001222, gpf=A006530 and spf=A020639.
- Decimal primes whose decimal representation in base 16 is also prime.A089968
Decimal primes whose decimal representation in base 16 is also prime.
- Numbers m such that for increasing b the numbers of zeros in base b representation of m are monotonically decreasing, 1<b<m.A089969
Numbers m such that for increasing b the numbers of zeros in base b representation of m are monotonically decreasing, 1<b<m.
- Numbers n such that for increasing b the numbers of zeros in base b representation of n are not monotonically decreasing, 1<b<n.A089970
Numbers n such that for increasing b the numbers of zeros in base b representation of n are not monotonically decreasing, 1<b<n.
- Primes whose decimal representation also represents a prime in base 2.A089971
Primes whose decimal representation also represents a prime in base 2.
- Duplicate of A008062.A089972
Duplicate of A008062.
- Number of maximum-length 2-surprising sequences in n symbols.A089973
Number of maximum-length 2-surprising sequences in n symbols.
- (n+1)-st term of the n-th binomial transform of this sequence equals 1 for all n>=0.A089974
(n+1)-st term of the n-th binomial transform of this sequence equals 1 for all n>=0.
- Array read by ascending antidiagonals: T(n,k) is the number of n-letter words from a k-letter alphabet such that no letter appears more than twice.A089975
Array read by ascending antidiagonals: T(n,k) is the number of n-letter words from a k-letter alphabet such that no letter appears more than twice.
- Antidiagonal sums of array A089975.A089976
Antidiagonal sums of array A089975.
- Expansion of 1/((1-2*x)*(1+x+2*x^2)).A089977
Expansion of 1/((1-2*x)*(1+x+2*x^2)).
- Expansion of 1/(1-3x-3x^3).A089978
Expansion of 1/(1-3x-3x^3).
- Expansion of 1/(1-4x-4x^3).A089979
Expansion of 1/(1-4x-4x^3).
- Array read by antidiagonals: T(n,m) = number of independent sets in the grid graph P_n X P_m.A089980
Array read by antidiagonals: T(n,m) = number of independent sets in the grid graph P_n X P_m.
- Primes whose decimal representation also represents a prime in base 3.A089981
Primes whose decimal representation also represents a prime in base 3.
- Triangular numbers that can be expressed as the sum of 2 positive triangular numbers.A089982
Triangular numbers that can be expressed as the sum of 2 positive triangular numbers.
- 1, 1, 1, 1, ... a, b, c, d, ab-cd, ...A089983
1, 1, 1, 1, ... a, b, c, d, ab-cd, ...
- 1, 1, 1, 1, ... a, b, c, d, ac-bd, ...A089984
1, 1, 1, 1, ... a, b, c, d, ac-bd, ...
- a(n) = A089709(n+1)/A089709(n).A089985
a(n) = A089709(n+1)/A089709(n).
- Numbers n such that 4n + 7 is prime.A089986
Numbers n such that 4n + 7 is prime.
- Primes in the concatenation of consecutive numbers beginning with 2.A089987
Primes in the concatenation of consecutive numbers beginning with 2.
- Possible differences of n^2*(n+1)/2.A089988
Possible differences of n^2*(n+1)/2.
- a(n) = 5^(n^2+2n+1)*Product_{j=1..n} (25^j-1).A089989
a(n) = 5^(n^2+2n+1)*Product_{j=1..n} (25^j-1).
- a(n) = n step nested walk based on (A004001[n]+ (-1)^lastsum).A089990
a(n) = n step nested walk based on (A004001[n]+ (-1)^lastsum).
- Maximum lengths of chaotic walks based on the A004001 sequence.A089991
Maximum lengths of chaotic walks based on the A004001 sequence.
- Second prime divisor of numbers that are not powers of primes (A024619).A089992
Second prime divisor of numbers that are not powers of primes (A024619).
- Penultimate prime divisor of numbers that are not powers of primes (A024619).A089993
Penultimate prime divisor of numbers that are not powers of primes (A024619).
- Number of primes between factors of n-th semiprime.A089994
Number of primes between factors of n-th semiprime.
- Products of pairs of distinct, non-consecutive primes.A089995
Products of pairs of distinct, non-consecutive primes.
- a(n) = primes generated by the function ( f[n_]=Floor[(A004001[n]*Prime[n])*Log[2]/(2*PrimePi[n]+1)]).A089996
a(n) = primes generated by the function ( f[n_]=Floor[(A004001[n]*Prime[n])*Log[2]/(2*PrimePi[n]+1)]).
- a(n) = Floor[Exp[(Composite[n]-Sqrt[Composite[n]*CompositePi[n]])/(-CompositePi[n]+ Sqrt[Composite[n]*CompositePi[n]])]].A089997
a(n) = Floor[Exp[(Composite[n]-Sqrt[Composite[n]*CompositePi[n]])/(-CompositePi[n]+ Sqrt[Composite[n]*CompositePi[n]])]].
- Smallest square with Hamming weight n (i.e., with exactly n 1's when written in binary).A089998
Smallest square with Hamming weight n (i.e., with exactly n 1's when written in binary).
- Smallest triangular number with Hamming weight n (i.e., with exactly n 1's when written in binary).A089999
Smallest triangular number with Hamming weight n (i.e., with exactly n 1's when written in binary).
- Length of longest contiguous block of 1's in binary expansion of n-th prime.A090000
Length of longest contiguous block of 1's in binary expansion of n-th prime.
- Length of longest contiguous block of 1's in binary expansion of n^2.A090001
Length of longest contiguous block of 1's in binary expansion of n^2.
- Length of longest contiguous block of 1's in binary expansion of n-th triangular number.A090002
Length of longest contiguous block of 1's in binary expansion of n-th triangular number.
- Length of longest contiguous block of 1's in binary expansion of n^3.A090003
Length of longest contiguous block of 1's in binary expansion of n^3.
- Expansion of L(x)^(1/2), where L(x) is the g.f. for the Catalan Larcombe-French sequence A053175.A090004
Expansion of L(x)^(1/2), where L(x) is the g.f. for the Catalan Larcombe-French sequence A053175.
- Gromov-Witten invariants of intersection type (3,3).A090005
Gromov-Witten invariants of intersection type (3,3).
- Gromov-Witten invariants of intersection type (2,4).A090006
Gromov-Witten invariants of intersection type (2,4).
- Gromov-Witten invariants of intersection type (2,2,2,2).A090007
Gromov-Witten invariants of intersection type (2,2,2,2).
- Gromov-Witten invariants of intersection type (2,2,3).A090008
Gromov-Witten invariants of intersection type (2,2,3).
- Begins the earliest length-n chain of primes such that any term in the chain equals the previous term increased by the sum of its digits.A090009
Begins the earliest length-n chain of primes such that any term in the chain equals the previous term increased by the sum of its digits.
- Permanent of (0,1)-matrix of size n X (n+d) with d=6 and n zeros not on a line.A090010
Permanent of (0,1)-matrix of size n X (n+d) with d=6 and n zeros not on a line.