Sequences
392,541 sequences
- Third column of triangle A067410 and second column of A067417.A067411
Third column of triangle A067410 and second column of A067417.
- Fourth column of triangle A067410.A067412
Fourth column of triangle A067410.
- Sixth column of triangle A067410.A067413
Sixth column of triangle A067410.
- Seventh column of triangle A067410.A067414
Seventh column of triangle A067410.
- Eighth column of triangle A067410.A067415
Eighth column of triangle A067410.
- Ninth column of triangle A067410.A067416
Ninth column of triangle A067410.
- Triangle with columns built from certain power sequences.A067417
Triangle with columns built from certain power sequences.
- Triangle A067330 with rows read backwards.A067418
Triangle A067330 with rows read backwards.
- Fourth column of triangle A067417.A067419
Fourth column of triangle A067417.
- Fifth column of triangle A067417.A067420
Fifth column of triangle A067417.
- Sixth column of triangle A067417.A067421
Sixth column of triangle A067417.
- Seventh column of triangle A067417.A067422
Seventh column of triangle A067417.
- Eighth column of triangle A067417.A067423
Eighth column of triangle A067417.
- Ninth column of triangle A067417.A067424
Ninth column of triangle A067417.
- Triangle with columns built from certain power sequences.A067425
Triangle with columns built from certain power sequences.
- Sixth column of triangle A067425.A067426
Sixth column of triangle A067425.
- Seventh column of triangle A067425.A067427
Seventh column of triangle A067425.
- Eighth column of triangle A067425.A067428
Eighth column of triangle A067425.
- Ninth column of triangle A067425.A067429
Ninth column of triangle A067425.
- Convolution of Fibonacci F(n+1), n>=0, with F(n+7), n>=0.A067430
Convolution of Fibonacci F(n+1), n>=0, with F(n+7), n>=0.
- Convolution of Fibonacci F(n+1), n>=0, with F(n+8), n>=0.A067431
Convolution of Fibonacci F(n+1), n>=0, with F(n+8), n>=0.
- Number of ways to represent the n-th prime in form p*q+p+q, where p and q are primes (see A066938).A067432
Number of ways to represent the n-th prime in form p*q+p+q, where p and q are primes (see A066938).
- Triangle in which row n gives trajectory of n under the map k -> k/3 if k is divisible by 3, otherwise k -> next multiple of 3, stopping when reaching 1 (the initial term n is not included).A067433
Triangle in which row n gives trajectory of n under the map k -> k/3 if k is divisible by 3, otherwise k -> next multiple of 3, stopping when reaching 1 (the initial term n is not included).
- Number of distinct prime factors in binomial(2*n,n).A067434
Number of distinct prime factors in binomial(2*n,n).
- a(n) is the sum of all the remainders when n-th odd number is divided by odd numbers < 2n-1.A067435
a(n) is the sum of all the remainders when n-th odd number is divided by odd numbers < 2n-1.
- a(n) = sum of all the remainders when n-th even number is divided by even numbers < 2n.A067436
a(n) = sum of all the remainders when n-th even number is divided by even numbers < 2n.
- Number of distinct prime factors in binomial(2*n,n)+1.A067437
Number of distinct prime factors in binomial(2*n,n)+1.
- Number of distinct prime factors in floor((4/3)^n).A067438
Number of distinct prime factors in floor((4/3)^n).
- a(n) = sum of all the remainders when n is divided by positive integers less than and coprime to n.A067439
a(n) = sum of all the remainders when n is divided by positive integers less than and coprime to n.
- Sum(i(n)), where i(n) is the smallest integer with i(n)^m=n for some m.A067440
Sum(i(n)), where i(n) is the smallest integer with i(n)^m=n for some m.
- Number of distinct prime factors in floor((5/4)^n).A067441
Number of distinct prime factors in floor((5/4)^n).
- a(1) = 1 and then smallest nontrivial n-th power starting with 1.A067442
a(1) = 1 and then smallest nontrivial n-th power starting with 1.
- Smallest n-th power starting with 2.A067443
Smallest n-th power starting with 2.
- Smallest n-th power starting with 3.A067444
Smallest n-th power starting with 3.
- Smallest n-th power starting with 4.A067445
Smallest n-th power starting with 4.
- Smallest n-th power starting with 5.A067446
Smallest n-th power starting with 5.
- Smallest n-th power starting with 6.A067447
Smallest n-th power starting with 6.
- Smallest n-th power whose decimal expansion starts with 7.A067448
Smallest n-th power whose decimal expansion starts with 7.
- Smallest n-th power starting with 8.A067449
Smallest n-th power starting with 8.
- Smallest n-th power starting with 9.A067450
Smallest n-th power starting with 9.
- Numbers such that the geometric and arithmetic mean of their decimal digits are integers.A067451
Numbers such that the geometric and arithmetic mean of their decimal digits are integers.
- Numbers, not composed of the same digits, such that the geometric and arithmetic means of their decimal digits are integers.A067452
Numbers, not composed of the same digits, such that the geometric and arithmetic means of their decimal digits are integers.
- a(n) = binomial(a,b) where a>=b and one of a and b is the product of the nonzero decimal digits of n and the other is the sum of the decimal digits of n.A067453
a(n) = binomial(a,b) where a>=b and one of a and b is the product of the nonzero decimal digits of n and the other is the sum of the decimal digits of n.
- Binomial(a,b) where a = n! and b = sum of first n natural numbers.A067454
Binomial(a,b) where a = n! and b = sum of first n natural numbers.
- Let m be the product of the decimal digits in n, then a(n) = 0 if m = 0, otherwise a(n) = n!/m.A067455
Let m be the product of the decimal digits in n, then a(n) = 0 if m = 0, otherwise a(n) = n!/m.
- Floor( sqrt( sum of the decimal digits of n squared)).A067456
Floor( sqrt( sum of the decimal digits of n squared)).
- Smallest n-th power starting with n.A067457
Smallest n-th power starting with n.
- Sum of remainders when n is divided by its nonzero digits.A067458
Sum of remainders when n is divided by its nonzero digits.
- Sum of the remainders when n^2 is divided by squares less than n.A067459
Sum of the remainders when n^2 is divided by squares less than n.
- a(n) = mu(prime(n)-1)+1.A067460
a(n) = mu(prime(n)-1)+1.