Sequences
392,541 sequences
- Nested floor product of n and fractions (k+1)/k for all k>0 (mod 4), divided by 4.A073361
Nested floor product of n and fractions (k+1)/k for all k>0 (mod 4), divided by 4.
- Nested floor product of n and fractions (k+1)/k for all k>0 (mod 5), divided by 5.A073362
Nested floor product of n and fractions (k+1)/k for all k>0 (mod 5), divided by 5.
- Nested floor product of n and fractions (k+1)/k for all k>0 (mod 6), divided by 6.A073363
Nested floor product of n and fractions (k+1)/k for all k>0 (mod 6), divided by 6.
- Number of permutations p of (1,2,3,...,n) such that k+p(k) is prime for 1<=k<=n.A073364
Number of permutations p of (1,2,3,...,n) such that k+p(k) is prime for 1<=k<=n.
- Decimal expansion of log(log(Pi)).A073365
Decimal expansion of log(log(Pi)).
- Remainder when n-th prime is divided by number of composites not exceeding n.A073366
Remainder when n-th prime is divided by number of composites not exceeding n.
- Remainder when n-th composite is divided by number of composites not exceeding n.A073367
Remainder when n-th composite is divided by number of composites not exceeding n.
- Remainder when n is divided by number of composites not exceeding n.A073368
Remainder when n is divided by number of composites not exceeding n.
- Let c(1)=n, e=2.71... and c(k+1)=floor(c(k)/e) if c(k) is even, c(k+1)=floor(e*c(k)) otherwise; sequence gives the smallest value a(n) such that c(a(n))=0.A073369
Let c(1)=n, e=2.71... and c(k+1)=floor(c(k)/e) if c(k) is even, c(k+1)=floor(e*c(k)) otherwise; sequence gives the smallest value a(n) such that c(a(n))=0.
- Convolution triangle of A001045(n+1) (generalized (1,2)-Fibonacci), n>=0.A073370
Convolution triangle of A001045(n+1) (generalized (1,2)-Fibonacci), n>=0.
- Convolution of A001045(n+1) (generalized (1,2)-Fibonacci), n >= 0, with itself.A073371
Convolution of A001045(n+1) (generalized (1,2)-Fibonacci), n >= 0, with itself.
- Second convolution of A001045(n+1) (generalized (1,2)-Fibonacci), n>=0, with itself.A073372
Second convolution of A001045(n+1) (generalized (1,2)-Fibonacci), n>=0, with itself.
- Third convolution of A001045(n+1) (generalized (1,2)-Fibonacci), n>=0, with itself.A073373
Third convolution of A001045(n+1) (generalized (1,2)-Fibonacci), n>=0, with itself.
- Fourth convolution of A001045(n+1) (generalized (1,2)-Fibonacci), n>=0, with itself.A073374
Fourth convolution of A001045(n+1) (generalized (1,2)-Fibonacci), n>=0, with itself.
- Fifth convolution of A001045(n+1) (generalized (1,2)-Fibonacci), n>=0, with itself.A073375
Fifth convolution of A001045(n+1) (generalized (1,2)-Fibonacci), n>=0, with itself.
- Sixth convolution of A001045(n+1) (generalized (1,2)-Fibonacci), n>=0, with itself.A073376
Sixth convolution of A001045(n+1) (generalized (1,2)-Fibonacci), n>=0, with itself.
- Seventh convolution of A001045(n+1) (generalized (1,2)-Fibonacci), n>=0, with itself.A073377
Seventh convolution of A001045(n+1) (generalized (1,2)-Fibonacci), n>=0, with itself.
- Eighth convolution of A001045(n+1) (generalized (1,2)-Fibonacci), n>=0, with itself.A073378
Eighth convolution of A001045(n+1) (generalized (1,2)-Fibonacci), n>=0, with itself.
- Ninth convolution of A001045(n+1) (generalized (1,2)-Fibonacci), n>=0, with itself.A073379
Ninth convolution of A001045(n+1) (generalized (1,2)-Fibonacci), n>=0, with itself.
- Third convolution of A000129(n+1) (generalized (2,1)-Fibonacci, called Pell numbers), n>=0, with itself.A073380
Third convolution of A000129(n+1) (generalized (2,1)-Fibonacci, called Pell numbers), n>=0, with itself.
- Fourth convolution of A000129(n+1) (generalized (2,1)-Fibonacci, called Pell numbers), n>=0, with itself.A073381
Fourth convolution of A000129(n+1) (generalized (2,1)-Fibonacci, called Pell numbers), n>=0, with itself.
- Fifth convolution of A000129(n+1) (generalized (2,1)-Fibonacci, called Pell numbers), n>=0, with itself.A073382
Fifth convolution of A000129(n+1) (generalized (2,1)-Fibonacci, called Pell numbers), n>=0, with itself.
- Sixth convolution of A000129(n+1) (generalized (2,1)-Fibonacci, called Pell numbers), n>=0, with itself.A073383
Sixth convolution of A000129(n+1) (generalized (2,1)-Fibonacci, called Pell numbers), n>=0, with itself.
- Seventh convolution of A000129(n+1) (generalized (2,1)-Fibonacci, called Pell numbers), n>=0, with itself.A073384
Seventh convolution of A000129(n+1) (generalized (2,1)-Fibonacci, called Pell numbers), n>=0, with itself.
- Eighth convolution of A000129(n+1) (generalized (2,1)-Fibonacci, called Pell numbers), n>=0, with itself.A073385
Eighth convolution of A000129(n+1) (generalized (2,1)-Fibonacci, called Pell numbers), n>=0, with itself.
- Ninth convolution of A000129(n+1) (generalized (2,1)-Fibonacci, called Pell numbers), n>=0, with itself.A073386
Ninth convolution of A000129(n+1) (generalized (2,1)-Fibonacci, called Pell numbers), n>=0, with itself.
- Convolution triangle of A002605(n) (generalized (2,2)-Fibonacci), n>=0.A073387
Convolution triangle of A002605(n) (generalized (2,2)-Fibonacci), n>=0.
- Convolution of A002605(n) (generalized (2,2)-Fibonacci), n >= 0, with itself.A073388
Convolution of A002605(n) (generalized (2,2)-Fibonacci), n >= 0, with itself.
- Second convolution of A002605(n) (generalized (2,2)-Fibonacci), n >= 0, with itself.A073389
Second convolution of A002605(n) (generalized (2,2)-Fibonacci), n >= 0, with itself.
- Third convolution of A002605(n) (generalized (2,2)-Fibonacci), n >= 0, with itself.A073390
Third convolution of A002605(n) (generalized (2,2)-Fibonacci), n >= 0, with itself.
- Fourth convolution of A002605(n) (generalized (2,2)-Fibonacci), n >= 0, with itself.A073391
Fourth convolution of A002605(n) (generalized (2,2)-Fibonacci), n >= 0, with itself.
- Fifth convolution of A002605(n) (generalized (2,2)-Fibonacci), n >= 0, with itself.A073392
Fifth convolution of A002605(n) (generalized (2,2)-Fibonacci), n >= 0, with itself.
- Sixth convolution of A002605(n) (generalized (2,2)-Fibonacci), n >= 0, with itself.A073393
Sixth convolution of A002605(n) (generalized (2,2)-Fibonacci), n >= 0, with itself.
- Seventh convolution of A002605(n) (generalized (2,2)-Fibonacci), n >= 0, with itself.A073394
Seventh convolution of A002605(n) (generalized (2,2)-Fibonacci), n >= 0, with itself.
- Product of sums of prime factors of n: with and without repetition.A073395
Product of sums of prime factors of n: with and without repetition.
- The number n equals the product of two numbers: sums of prime factors of n, with and without repetition.A073396
The number n equals the product of two numbers: sums of prime factors of n, with and without repetition.
- Eighth convolution of A002605(n) (generalized (2,2)-Fibonacci), n>=0, with itself.A073397
Eighth convolution of A002605(n) (generalized (2,2)-Fibonacci), n>=0, with itself.
- Ninth convolution of A002605(n) (generalized (2,2)-Fibonacci), n>=0, with itself.A073398
Ninth convolution of A002605(n) (generalized (2,2)-Fibonacci), n>=0, with itself.
- Coefficient triangle of polynomials (falling powers) related to convolutions of A001045(n+1), n>=0, (generalized (1,2)-Fibonacci). Companion triangle is A073400.A073399
Coefficient triangle of polynomials (falling powers) related to convolutions of A001045(n+1), n>=0, (generalized (1,2)-Fibonacci). Companion triangle is A073400.
- Coefficient triangle of polynomials (falling powers) related to convolutions of A001045(n+1), n >= 0, (generalized (1,2)-Fibonacci). Companion triangle is A073399.A073400
Coefficient triangle of polynomials (falling powers) related to convolutions of A001045(n+1), n >= 0, (generalized (1,2)-Fibonacci). Companion triangle is A073399.
- Coefficient triangle of polynomials (rising powers) related to convolutions of A001045(n+1), n >= 0, (generalized (1,2)-Fibonacci). Companion triangle is A073402.A073401
Coefficient triangle of polynomials (rising powers) related to convolutions of A001045(n+1), n >= 0, (generalized (1,2)-Fibonacci). Companion triangle is A073402.
- Coefficient triangle of polynomials (rising powers) related to convolutions of A001045(n+1), n >= 0, (generalized (1,2)-Fibonacci). Companion triangle is A073401.A073402
Coefficient triangle of polynomials (rising powers) related to convolutions of A001045(n+1), n >= 0, (generalized (1,2)-Fibonacci). Companion triangle is A073401.
- Coefficient triangle of polynomials (falling powers) related to convolutions of A002605(n), n>=0, (generalized (2,2)-Fibonacci). Companion triangle is A073404.A073403
Coefficient triangle of polynomials (falling powers) related to convolutions of A002605(n), n>=0, (generalized (2,2)-Fibonacci). Companion triangle is A073404.
- Coefficient triangle of polynomials (falling powers) related to convolutions of A002605(n), n>=0, (generalized (2,2)-Fibonacci). Companion triangle is A073403.A073404
Coefficient triangle of polynomials (falling powers) related to convolutions of A002605(n), n>=0, (generalized (2,2)-Fibonacci). Companion triangle is A073403.
- Coefficient triangle of polynomials (rising powers) related to convolutions of A002605(n), n >= 0, (generalized (2,2)-Fibonacci). Companion triangle is A073406.A073405
Coefficient triangle of polynomials (rising powers) related to convolutions of A002605(n), n >= 0, (generalized (2,2)-Fibonacci). Companion triangle is A073406.
- Coefficient triangle of polynomials (rising powers) related to convolutions of A002605(n), n>=0, (generalized (2,2)-Fibonacci). Companion triangle is A073405.A073406
Coefficient triangle of polynomials (rising powers) related to convolutions of A002605(n), n>=0, (generalized (2,2)-Fibonacci). Companion triangle is A073405.
- Let phi_m(x) denote the Euler totient function applied m times to x. Sequence gives the minimum number of iterations m such that phi_m(n) divides n.A073407
Let phi_m(x) denote the Euler totient function applied m times to x. Sequence gives the minimum number of iterations m such that phi_m(n) divides n.
- Let cophi_m(x) denotes the cototient function applied m times to x (cophi(x)=x-phi(x)). Sequence gives the minimum number of iterations m such that cophi_m(n) divides n.A073408
Let cophi_m(x) denotes the cototient function applied m times to x (cophi(x)=x-phi(x)). Sequence gives the minimum number of iterations m such that cophi_m(n) divides n.
- Largest prime factor of the denominator of the Bernoulli number B(2*n) (A002445).A073409
Largest prime factor of the denominator of the Bernoulli number B(2*n) (A002445).
- Number of permutations p of (1,2,3,...,n) such that 1*(-1)^p(1)+2*(-1)^p(2)+3*(-1)^p(3)+...+n*(-1)^p(n)=0.A073410
Number of permutations p of (1,2,3,...,n) such that 1*(-1)^p(1)+2*(-1)^p(2)+3*(-1)^p(3)+...+n*(-1)^p(n)=0.