Sequences
392,541 sequences
- Numbers k such that ceiling(sqrt(k)) divides k.A087811
Numbers k such that ceiling(sqrt(k)) divides k.
- Sum of MoebiusMu for numbers between n and 2n inclusive.A087812
Sum of MoebiusMu for numbers between n and 2n inclusive.
- (1/p)*(binomial(2p,p)-2^p) as p runs through the primes.A087813
(1/p)*(binomial(2p,p)-2^p) as p runs through the primes.
- Sequence gives A087655(n) for those n such that A087655(n) = A087655(n+1).A087814
Sequence gives A087655(n) for those n such that A087655(n) = A087655(n+1).
- Terms in A087816 that occur in a run of length more than 1.A087815
Terms in A087816 that occur in a run of length more than 1.
- a(n) = a(a(n-1)) + a(n - 1 - a(n-1)) with a(1) = a(2) = 1.A087816
a(n) = a(a(n-1)) + a(n - 1 - a(n-1)) with a(1) = a(2) = 1.
- a(n) = a(a(a(n-1)))+a(n-a(n-1)).A087817
a(n) = a(a(a(n-1)))+a(n-a(n-1)).
- Consider numbers x = 4*n + 1 which are of the form x = y^2 + z^2 with y <= z; sequence gives smallest value of y.A087818
Consider numbers x = 4*n + 1 which are of the form x = y^2 + z^2 with y <= z; sequence gives smallest value of y.
- z values corresponding to A087818.A087819
z values corresponding to A087818.
- Primes P of the form P=(j*P(i)#)/2 - 2 such that P+4 is the next prime, where j is odd, 0 < j < P(i+1), P(i) = i-th prime, P(i)# = i-th primorial (A002110).A087820
Primes P of the form P=(j*P(i)#)/2 - 2 such that P+4 is the next prime, where j is odd, 0 < j < P(i+1), P(i) = i-th prime, P(i)# = i-th primorial (A002110).
- Sequence of primes P(i) such that P=(j*P(i)#)/2 - 2 and P+4 are consecutive primes, where j is odd, 0 < j < P(i+1) and P(i) denotes i-th prime.A087821
Sequence of primes P(i) such that P=(j*P(i)#)/2 - 2 and P+4 are consecutive primes, where j is odd, 0 < j < P(i+1) and P(i) denotes i-th prime.
- Sequence of j such that P=(j*P(i)#)/2 - 2 and P+4 are consecutive primes, where j is odd, 0 < j < P(i+1) and P(i) denotes i-th prime.A087822
Sequence of j such that P=(j*P(i)#)/2 - 2 and P+4 are consecutive primes, where j is odd, 0 < j < P(i+1) and P(i) denotes i-th prime.
- a(1) = a(2) = 1; for n > 2, a(n) = a(a(a(n-2))) + a(n-a(n-2)).A087823
a(1) = a(2) = 1; for n > 2, a(n) = a(a(a(n-2))) + a(n-a(n-2)).
- a(n) = number of times n occurs in A087817.A087824
a(n) = number of times n occurs in A087817.
- a(n) = number of times n occurs in A087823.A087825
a(n) = number of times n occurs in A087823.
- a(n) = a(n-a(n-1)) + a(a(n-a(n-2))).A087826
a(n) = a(n-a(n-1)) + a(a(n-a(n-2))).
- a(n) = a(a(Min(n-1,Abs(n-a(n-1)))))+a(Abs(n-a(n-3))).A087827
a(n) = a(a(Min(n-1,Abs(n-a(n-1)))))+a(Abs(n-a(n-3))).
- a(n) = a(Min(n-1,Abs(n - a(n-1)))) + a(a(Abs(n - a(n-3)))).A087828
a(n) = a(Min(n-1,Abs(n - a(n-1)))) + a(a(Abs(n - a(n-3)))).
- a[n] =a[a[Abs[n - a[n-1]]]] + a[Abs[n - a[n-4]]].A087829
a[n] =a[a[Abs[n - a[n-1]]]] + a[Abs[n - a[n-4]]].
- Consecutive repeats in A087831, the triple recursion skip two Hofstadter Q of the second sort.A087830
Consecutive repeats in A087831, the triple recursion skip two Hofstadter Q of the second sort.
- a(n) = a(abs(n-a(n-1))) + a(a(abs(n-a(n-4)))) if n>4, a(n) = 1 otherwise.A087831
a(n) = a(abs(n-a(n-1))) + a(a(abs(n-a(n-4)))) if n>4, a(n) = 1 otherwise.
- Numbers k such that k*primorial(2473)-1 is prime.A087832
Numbers k such that k*primorial(2473)-1 is prime.
- a(n)*primorial(2423)+1 is prime.A087833
a(n)*primorial(2423)+1 is prime.
- a[n] =a[a[a[n-1]]] + a[n -1- a[n-2]].A087834
a[n] =a[a[a[n-1]]] + a[n -1- a[n-2]].
- a(n)*primorial(2777)-1 is prime.A087835
a(n)*primorial(2777)-1 is prime.
- a(n) = a(a(a(a(n-1)))) + a(n - a(n-1)) with a(1)=a(2)=1.A087836
a(n) = a(a(a(a(n-1)))) + a(n - a(n-1)) with a(1)=a(2)=1.
- a(n)*primorial(2749)+1 is prime.A087837
a(n)*primorial(2749)+1 is prime.
- a[n] =a[a[a[a[n-2]]]]+ a[n - a[n-2]].A087838
a[n] =a[a[a[a[n-2]]]]+ a[n - a[n-2]].
- a(n) = a(a(a(a(a(n-2))))) + a(n - a(n-2)).A087839
a(n) = a(a(a(a(a(n-2))))) + a(n - a(n-2)).
- Sequence of primes P(i) such that j*P(i)# - P(i+1) and j*P(i)# + P(i+1) are consecutive primes with 0 < j < P(i+1).A087840
Sequence of primes P(i) such that j*P(i)# - P(i+1) and j*P(i)# + P(i+1) are consecutive primes with 0 < j < P(i+1).
- Sequence of j such that j*P(i)# -P(i+1) and j*P(i)# +P(i+1) are consecutive primes with 0 < j < P(i+1).A087841
Sequence of j such that j*P(i)# -P(i+1) and j*P(i)# +P(i+1) are consecutive primes with 0 < j < P(i+1).
- a(n) = a(a(a(n - a(n-1)))) + a(n - a(n-2)).A087842
a(n) = a(a(a(n - a(n-1)))) + a(n - a(n-2)).
- a(n) = a(n - a(n-1)) + a(a(a(n - a(n-2)))).A087843
a(n) = a(n - a(n-1)) + a(a(a(n - a(n-2)))).
- a(n) = a(a(a(min(n-1, abs(n - a(n-1)))))) + a(abs(n - a(n-3))).A087844
a(n) = a(a(a(min(n-1, abs(n - a(n-1)))))) + a(abs(n - a(n-3))).
- a[n] =a[Min[n-1,Abs[n - a[n-1]]]] + a[a[a[Abs[n - a[n-3]]]]].A087845
a[n] =a[Min[n-1,Abs[n - a[n-1]]]] + a[a[a[Abs[n - a[n-3]]]]].
- a(n) = a(a(a(abs(n - a(n-1))))) + a(abs(n - a(n-4))).A087846
a(n) = a(a(a(abs(n - a(n-1))))) + a(abs(n - a(n-4))).
- a(n) = a(|n - a(n-1)|) + a(a(a(|n - a(n-4)|))).A087847
a(n) = a(|n - a(n-1)|) + a(a(a(|n - a(n-4)|))).
- Duplicate of A087844.A087848
Duplicate of A087844.
- a(n) = a(a(a(n-1))) + abs(2*a(n-1)-n) starting with 1,1.A087849
a(n) = a(a(a(n-1))) + abs(2*a(n-1)-n) starting with 1,1.
- a(n) = a(a(a(a(a(n-1))))) + abs(2*a(n-1)-n).A087850
a(n) = a(a(a(a(a(n-1))))) + abs(2*a(n-1)-n).
- a(n) = abs(a(n-1) - floor(n*phi)), where phi=(1+sqrt(5))/2, with a(1) = a(2) = 1.A087851
a(n) = abs(a(n-1) - floor(n*phi)), where phi=(1+sqrt(5))/2, with a(1) = a(2) = 1.
- Erroneous generalization of A087851.A087852
Erroneous generalization of A087851.
- Erroneous generalization of A087851.A087853
Erroneous generalization of A087851.
- Triangle read by rows: T(n,k) is the number of n-bead necklaces with exactly k different colored beads.A087854
Triangle read by rows: T(n,k) is the number of n-bead necklaces with exactly k different colored beads.
- a(n) = number of values k such that A086567(k) = n.A087855
a(n) = number of values k such that A086567(k) = n.
- Primes of the form 16*m^2 + 25, m=1,3,5,...A087856
Primes of the form 16*m^2 + 25, m=1,3,5,...
- Primes of the form 16*m^2 + 25 for m=1,2,3,...A087857
Primes of the form 16*m^2 + 25 for m=1,2,3,...
- Lesser of twin primes p such that 2^p-1 is prime.A087858
Lesser of twin primes p such that 2^p-1 is prime.
- a(n) is the number of twin primes x-1,x+1 such that x=j*(p(n)#)/p(k), where 1 <= j < p(n+1) and 1 <= k <= n and p(k) doesn't divide j.A087859
a(n) is the number of twin primes x-1,x+1 such that x=j*(p(n)#)/p(k), where 1 <= j < p(n+1) and 1 <= k <= n and p(k) doesn't divide j.
- Expansion of e.g.f.: (1-exp(x/(x-1)))/(1-x).A087860
Expansion of e.g.f.: (1-exp(x/(x-1)))/(1-x).