Sequences
392,541 sequences
- a(n) = (1/24)*(sigma_3(2*n-1) - sigma_1(2*n-1)).A081861
a(n) = (1/24)*(sigma_3(2*n-1) - sigma_1(2*n-1)).
- (1/168)*(sigma_7(2n-1)-sigma_1(2n-1)).A081862
(1/168)*(sigma_7(2n-1)-sigma_1(2n-1)).
- Largest integer m such that m divides (sigma_(2n+1)(2k-1)-sigma(2k-1)) for all k>=1.A081863
Largest integer m such that m divides (sigma_(2n+1)(2k-1)-sigma(2k-1)) for all k>=1.
- Sum of 5th powers of the divisors of odd numbers: a(n) = sigma_5(2n-1).A081864
Sum of 5th powers of the divisors of odd numbers: a(n) = sigma_5(2n-1).
- a(n) = sigma_7(2n-1).A081865
a(n) = sigma_7(2n-1).
- a(n) = sigma_9(2n-1).A081866
a(n) = sigma_9(2n-1).
- a(n) = sigma_11(2n-1).A081867
a(n) = sigma_11(2n-1).
- Numbers k such that Sum_{j=1..k} (binomial(2*j,j) mod 3) is even.A081868
Numbers k such that Sum_{j=1..k} (binomial(2*j,j) mod 3) is even.
- a(1)=2; for n>1, a(n)=2*a(n-1)-1 if that number is composite, a(n)=a(n-1)+1 otherwise.A081869
a(1)=2; for n>1, a(n)=2*a(n-1)-1 if that number is composite, a(n)=a(n-1)+1 otherwise.
- a(1)=1, a(n)=2*a(n-1)+1 if that number is not squarefree, a(n)=a(n-1)+1 otherwise.A081870
a(1)=1, a(n)=2*a(n-1)+1 if that number is not squarefree, a(n)=a(n-1)+1 otherwise.
- a(1)=1, a(n)=2*a(n-1)+1 if that number is composite, a(n)=a(n-1)+1 otherwise.A081871
a(1)=1, a(n)=2*a(n-1)+1 if that number is composite, a(n)=a(n-1)+1 otherwise.
- Long legs of primitive Pythagorean triangles sorted on semiperimeter.A081872
Long legs of primitive Pythagorean triangles sorted on semiperimeter.
- Ordered semiperimeter of primitive Pythagorean triangles with an odd short leg (or an even long leg).A081873
Ordered semiperimeter of primitive Pythagorean triangles with an odd short leg (or an even long leg).
- Ordered odd short legs of primitive Pythagorean triangles.A081874
Ordered odd short legs of primitive Pythagorean triangles.
- a(n) = Sum_{d|n} phi(n/d)*C(2*d,d)/2.A081875
a(n) = Sum_{d|n} phi(n/d)*C(2*d,d)/2.
- a(n) is the starting position of the second occurrence of a string of the initial n decimal digits of Pi in the decimal expansion of Pi.A081876
a(n) is the starting position of the second occurrence of a string of the initial n decimal digits of Pi in the decimal expansion of Pi.
- Duplicate of A049076.A081877
Duplicate of A049076.
- Triangle read by rows in which row n begins with n and iterates the process of dividing n by 2 if n is even, adding 3 if n is an odd prime, otherwise adding 1; stopping when either 1 or 3 is reached.A081878
Triangle read by rows in which row n begins with n and iterates the process of dividing n by 2 if n is even, adding 3 if n is an odd prime, otherwise adding 1; stopping when either 1 or 3 is reached.
- Number of steps for convergence (to 1 or 3) for the process in A081878.A081879
Number of steps for convergence (to 1 or 3) for the process in A081878.
- Triangle read by rows: n-th row gives trajectory of 2n under the map x->(x^2-4)/6, stopping when the next term would be negative or nonintegral.A081880
Triangle read by rows: n-th row gives trajectory of 2n under the map x->(x^2-4)/6, stopping when the next term would be negative or nonintegral.
- Pack bins of size 1 sequentially with items of size 1/1, 1/2, 1/3, 1/4, ... . Sequence gives values of n for which 1/n starts a new bin.A081881
Pack bins of size 1 sequentially with items of size 1/1, 1/2, 1/3, 1/4, ... . Sequence gives values of n for which 1/n starts a new bin.
- Number of steps needed to reach an integer starting with n-1/4 and iterating the map x ->x*ceiling(x).A081882
Number of steps needed to reach an integer starting with n-1/4 and iterating the map x ->x*ceiling(x).
- Numbers n such that the number of steps needed to reach an integer starting with n-1/4 or n+1/4 and iterating the map x-->x*ceiling(x) is the same.A081883
Numbers n such that the number of steps needed to reach an integer starting with n-1/4 or n+1/4 and iterating the map x-->x*ceiling(x) is the same.
- Number of steps needed to reach an integer starting with n+1/8 and iterating the map x-->x*ceiling(x).A081884
Number of steps needed to reach an integer starting with n+1/8 and iterating the map x-->x*ceiling(x).
- Number of steps needed to reach an integer starting with n+1/16 and iterating the map x-->x*ceiling(x).A081885
Number of steps needed to reach an integer starting with n+1/16 and iterating the map x-->x*ceiling(x).
- Duplicate of A081530.A081886
Duplicate of A081530.
- Numbers k such that lcm(1..k) equals the denominator of the sum of the first k harmonic numbers.A081887
Numbers k such that lcm(1..k) equals the denominator of the sum of the first k harmonic numbers.
- Numbers n such that the least positive primitive root of n is larger than the value for all positive numbers smaller than n.A081888
Numbers n such that the least positive primitive root of n is larger than the value for all positive numbers smaller than n.
- Least primitive root corresponding to A081888(n).A081889
Least primitive root corresponding to A081888(n).
- a(n) = 9^n - 8^n - 7^n - 6^n + 3*5^n.A081890
a(n) = 9^n - 8^n - 7^n - 6^n + 3*5^n.
- a(n) = 10^n - 9^n - 8^n - 7^n + 3*6^n.A081891
a(n) = 10^n - 9^n - 8^n - 7^n + 3*6^n.
- Second binomial transform of C(n+2,2).A081892
Second binomial transform of C(n+2,2).
- Third binomial transform of C(n+2,2).A081893
Third binomial transform of C(n+2,2).
- Fourth binomial transform of C(n+2,2).A081894
Fourth binomial transform of C(n+2,2).
- Second binomial transform of binomial(n+3, 3).A081895
Second binomial transform of binomial(n+3, 3).
- Third binomial transform of binomial(n+3, 3).A081896
Third binomial transform of binomial(n+3, 3).
- Fourth binomial transform of binomial(n+3, 3).A081897
Fourth binomial transform of binomial(n+3, 3).
- Second binomial transform of binomial(n+4, 4).A081898
Second binomial transform of binomial(n+4, 4).
- Third binomial transform of binomial(n+4, 4).A081899
Third binomial transform of binomial(n+4, 4).
- Fourth binomial transform of binomial(n+4, 4).A081900
Fourth binomial transform of binomial(n+4, 4).
- Second binomial transform of binomial(n+5, 5).A081901
Second binomial transform of binomial(n+5, 5).
- Third binomial transform of binomial(n+5, 5).A081902
Third binomial transform of binomial(n+5, 5).
- Fourth binomial transform of binomial(n+5, 5).A081903
Fourth binomial transform of binomial(n+5, 5).
- Second binomial transform of binomial(n+6, 6).A081904
Second binomial transform of binomial(n+6, 6).
- Third binomial transform of binomial(n+6, 6).A081905
Third binomial transform of binomial(n+6, 6).
- Fourth binomial transform of binomial(n+6, 6).A081906
Fourth binomial transform of binomial(n+6, 6).
- Fifth binomial transform of binomial(n+2, 2).A081907
Fifth binomial transform of binomial(n+2, 2).
- a(n) = 2^n*(n^2 - n + 8)/8.A081908
a(n) = 2^n*(n^2 - n + 8)/8.
- a(n) = 3^n(n^2 - n + 18)/18.A081909
a(n) = 3^n(n^2 - n + 18)/18.
- a(n) = 4^n*(n^2 - n + 32)/32.A081910
a(n) = 4^n*(n^2 - n + 32)/32.