Sequences
392,541 sequences
- a(n) is the decimal concatenation of n and n^2.A053061
a(n) is the decimal concatenation of n and n^2.
- Concatenate n, 2n, 3n, ... nn.A053062
Concatenate n, 2n, 3n, ... nn.
- Pendulum numbers: alternately append n to beginning or end of previous term.A053063
Pendulum numbers: alternately append n to beginning or end of previous term.
- Alternately append n to end or beginning of previous term.A053064
Alternately append n to end or beginning of previous term.
- Alternately append n-th prime to beginning or end of previous term.A053065
Alternately append n-th prime to beginning or end of previous term.
- Alternately append n-th prime to end or beginning of previous term.A053066
Alternately append n-th prime to end or beginning of previous term.
- a(n) is the concatenation of next n numbers (omit leading 0's).A053067
a(n) is the concatenation of next n numbers (omit leading 0's).
- Concatenation of next n Fibonacci numbers.A053068
Concatenation of next n Fibonacci numbers.
- Numbers that in Italian begin with the letter "d".A053069
Numbers that in Italian begin with the letter "d".
- Primes p such that p-6, p and p+6 are consecutive primes.A053070
Primes p such that p-6, p and p+6 are consecutive primes.
- Number of n X n invertible binary matrices A such that A^5+I is invertible.A053071
Number of n X n invertible binary matrices A such that A^5+I is invertible.
- Primes p such that p-12, p and p+12 are consecutive primes.A053072
Primes p such that p-12, p and p+12 are consecutive primes.
- Balanced primes separated from the next lower and next higher prime neighbors by 18.A053073
Balanced primes separated from the next lower and next higher prime neighbors by 18.
- Primes p such that p-24, p and p+24 are consecutive primes.A053074
Primes p such that p-24, p and p+24 are consecutive primes.
- Primes p such that p-30, p, p+30 are consecutive primes.A053075
Primes p such that p-30, p, p+30 are consecutive primes.
- Balanced primes separated from the next lower and next higher prime neighbors by 36.A053076
Balanced primes separated from the next lower and next higher prime neighbors by 36.
- Balanced primes separated from the next lower and next higher prime neighbors by 42.A053077
Balanced primes separated from the next lower and next higher prime neighbors by 42.
- Balanced primes separated from the next lower and next higher prime neighbors by 48.A053078
Balanced primes separated from the next lower and next higher prime neighbors by 48.
- a(1)=1; a(m+1) = Sum_{k=1..m} gcd(k, a(m+1-k)).A053079
a(1)=1; a(m+1) = Sum_{k=1..m} gcd(k, a(m+1-k)).
- Number of ways of getting 5 of a kind, royal flush, other straight flush, 4 of a kind, full house, other flush, other straight, 3 of a kind, 2 pair, a pair or no pair in 5-card poker when joker is wild.A053080
Number of ways of getting 5 of a kind, royal flush, other straight flush, 4 of a kind, full house, other flush, other straight, 3 of a kind, 2 pair, a pair or no pair in 5-card poker when joker is wild.
- Number of ways of getting no pair, a pair, 2 pair, 3 of a kind, other straight, other flush, full house, 4 of a kind, straight flush or 5 of a kind in 5-card poker when joker is wild.A053081
Number of ways of getting no pair, a pair, 2 pair, 3 of a kind, other straight, other flush, full house, 4 of a kind, straight flush or 5 of a kind in 5-card poker when joker is wild.
- Number of ways of getting no pair, a pair, 2 pair, 3 of a kind, other straight, other flush, full house, 4 of a kind, other straight flush, royal flush or 5 of a kind in 5-card poker when joker is wild.A053082
Number of ways of getting no pair, a pair, 2 pair, 3 of a kind, other straight, other flush, full house, 4 of a kind, other straight flush, royal flush or 5 of a kind in 5-card poker when joker is wild.
- Number of ways of getting 5 of a kind, royal flush, other straight flush, 4 of a kind, full house, other flush, other straight, 3 of a kind, 2 pair, a pair or no pair in 5-card poker with two jokers wild.A053083
Number of ways of getting 5 of a kind, royal flush, other straight flush, 4 of a kind, full house, other flush, other straight, 3 of a kind, 2 pair, a pair or no pair in 5-card poker with two jokers wild.
- Number of ways of getting no pair, a pair, 2 pair, 3 of a kind, other straight, other flush, full house, 4 of a kind, other straight flush, royal flush or 5 of a kind in 5-card poker with two jokers wild.A053084
Number of ways of getting no pair, a pair, 2 pair, 3 of a kind, other straight, other flush, full house, 4 of a kind, other straight flush, royal flush or 5 of a kind in 5-card poker with two jokers wild.
- Number of ways of getting 5 of a kind, royal flush, other straight flush, 4 of a kind, full house, other flush, other straight, 3 of a kind, 2 pair, a pair or no pair in 5-card poker with deuces wild.A053085
Number of ways of getting 5 of a kind, royal flush, other straight flush, 4 of a kind, full house, other flush, other straight, 3 of a kind, 2 pair, a pair or no pair in 5-card poker with deuces wild.
- Number of ways of getting no pair, a pair, 2 pair, 3 of a kind, other straight, other flush, full house, 4 of a kind, other straight flush, royal flush or 5 of a kind in 5-card poker with deuces wild.A053086
Number of ways of getting no pair, a pair, 2 pair, 3 of a kind, other straight, other flush, full house, 4 of a kind, other straight flush, royal flush or 5 of a kind in 5-card poker with deuces wild.
- a(n) is the smallest j for which 2^j kara n is defined (see A053405).A053087
a(n) is the smallest j for which 2^j kara n is defined (see A053405).
- a(n) = 3*a(n-2) + 2*a(n-3) for n > 2, a(0)=1, a(1)=0, a(2)=3.A053088
a(n) = 3*a(n-2) + 2*a(n-3) for n > 2, a(0)=1, a(1)=0, a(2)=3.
- a(n) = prime(n)^prime(n+1).A053089
a(n) = prime(n)^prime(n+1).
- Number of F^3-convex polyominoes on honeycomb lattice with given semiperimeter.A053090
Number of F^3-convex polyominoes on honeycomb lattice with given semiperimeter.
- Number of F^3-convex polyominoes on the honeycomb lattice by number of cells.A053091
Number of F^3-convex polyominoes on the honeycomb lattice by number of cells.
- 2^A053087 kara n.A053092
2^A053087 kara n.
- Smallest composite which when sum of prime factors is repeatedly subtracted reaches a prime after n iterations.A053093
Smallest composite which when sum of prime factors is repeatedly subtracted reaches a prime after n iterations.
- Primes found after n iterations in A053093.A053094
Primes found after n iterations in A053093.
- Number of primes having exactly the same digits as appear in first n primes.A053095
Number of primes having exactly the same digits as appear in first n primes.
- When the Euler phi function is iterated with initial value A002110(n) = primorial, a(n) = number of iterations required to reach the fixed number = 1.A053096
When the Euler phi function is iterated with initial value A002110(n) = primorial, a(n) = number of iterations required to reach the fixed number = 1.
- a(n) is the number of powers of 2 among the iterates of the Euler phi function when it is iterated with initial value A002110(n), the n-th primorial number.A053097
a(n) is the number of powers of 2 among the iterates of the Euler phi function when it is iterated with initial value A002110(n), the n-th primorial number.
- When the Euler phi function is iterated with initial value primorial(n) = A002110(n), a(n)= first (maximum) power of 2 emerging during iteration.A053098
When the Euler phi function is iterated with initial value primorial(n) = A002110(n), a(n)= first (maximum) power of 2 emerging during iteration.
- When the Euler phi function is iterated with initial value A002110(n) = n-th primorial, a(n) = exponent of largest power of 2 arising in the iteration.A053099
When the Euler phi function is iterated with initial value A002110(n) = n-th primorial, a(n) = exponent of largest power of 2 arising in the iteration.
- a(n) = ((6*n+7)(!^6))/7, related to A008542 ((6*n+1)(!^6) sextic, or 6-factorials).A053100
a(n) = ((6*n+7)(!^6))/7, related to A008542 ((6*n+1)(!^6) sextic, or 6-factorials).
- a(n) = ((6*n+8)(!^6))/8(!^6), related to A034689 (((6*n+2)(!^6))/2 sextic, or 6-factorials).A053101
a(n) = ((6*n+8)(!^6))/8(!^6), related to A034689 (((6*n+2)(!^6))/2 sextic, or 6-factorials).
- a(n) = ((6*n+9)(!^6))/9(!^6), related to A034723 (((6*n+3)(!^6))/3 sextic, or 6-factorials).A053102
a(n) = ((6*n+9)(!^6))/9(!^6), related to A034723 (((6*n+3)(!^6))/3 sextic, or 6-factorials).
- a(n) = ((6*n+10)(!^6))/10(!^6), related to A034724 (((6*n+4)(!^6))/4 sextic, or 6-factorials).A053103
a(n) = ((6*n+10)(!^6))/10(!^6), related to A034724 (((6*n+4)(!^6))/4 sextic, or 6-factorials).
- a(n) = ((7*n+8)(!^7))/8, related to A045754 ((7*n+1)(!^7) sept-, or 7-factorials).A053104
a(n) = ((7*n+8)(!^7))/8, related to A045754 ((7*n+1)(!^7) sept-, or 7-factorials).
- a(n) = ((7*n+9)(!^7))/9(!^7), related to A034829 (((7*n+2)(!^7))/2 sept-, or 7-factorials).A053105
a(n) = ((7*n+9)(!^7))/9(!^7), related to A034829 (((7*n+2)(!^7))/2 sept-, or 7-factorials).
- a(n) = ((7*n+10)(!^7))/10(1^7), related to A034830 (((7*n+3)(!^7))/3 sept-, or 7-factorials).A053106
a(n) = ((7*n+10)(!^7))/10(1^7), related to A034830 (((7*n+3)(!^7))/3 sept-, or 7-factorials).
- Expansion of 1/(1-8*x)^8.A053107
Expansion of 1/(1-8*x)^8.
- Expansion of 1/(1 - 9*x)^9.A053108
Expansion of 1/(1 - 9*x)^9.
- Expansion of 1/(1-10*x)^10.A053109
Expansion of 1/(1-10*x)^10.
- Expansion of (-1 + 1/(1-7*x)^7)/(49*x); related to A036226.A053110
Expansion of (-1 + 1/(1-7*x)^7)/(49*x); related to A036226.