Sequences
392,541 sequences
- a(0) = 0; a(n) = a(n-1) - n^2 if positive and new, otherwise a(n) = a(n-1) + n^2.A053461
a(0) = 0; a(n) = a(n-1) - n^2 if positive and new, otherwise a(n) = a(n-1) + n^2.
- Number of positive squarefree integers less than 10^n.A053462
Number of positive squarefree integers less than 10^n.
- First digit of sin(n).A053463
First digit of sin(n).
- a(n) = n*5^(n-1).A053464
a(n) = n*5^(n-1).
- Number of connected 2-multigraphs on n nodes.A053465
Number of connected 2-multigraphs on n nodes.
- Number of connected 3-multigraphs on n nodes.A053466
Number of connected 3-multigraphs on n nodes.
- Number of directed 2-multigraphs on n nodes.A053467
Number of directed 2-multigraphs on n nodes.
- Number of directed 3-multigraphs on n nodes.A053468
Number of directed 3-multigraphs on n nodes.
- a(n) = n*6^(n-1).A053469
a(n) = n*6^(n-1).
- a(n) is the cototient of n (A051953) iterated twice.A053470
a(n) is the cototient of n (A051953) iterated twice.
- a(n) is the cototient of n (A051953) iterated 3 times.A053471
a(n) is the cototient of n (A051953) iterated 3 times.
- a(n) is the cototient of n (A051953) iterated 4 times.A053472
a(n) is the cototient of n (A051953) iterated 4 times.
- a(n) is the cototient of n (A051953) iterated 5 times.A053473
a(n) is the cototient of n (A051953) iterated 5 times.
- Cototients of non-cototient numbers: A051953(A005278(n)).A053474
Cototients of non-cototient numbers: A051953(A005278(n)).
- 1 + the number of iterations of A051953 (Euler-cototient) function needed to reach 0, starting at n.A053475
1 + the number of iterations of A051953 (Euler-cototient) function needed to reach 0, starting at n.
- Smallest number m such that when A051953 is applied n times to m the result is neither a power of 2 nor 0.A053476
Smallest number m such that when A051953 is applied n times to m the result is neither a power of 2 nor 0.
- Sum of iterates of divisor number function A000005.A053477
Sum of iterates of divisor number function A000005.
- Sum of iterates when phi, A000010, is iterated until fixed point 1.A053478
Sum of iterates when phi, A000010, is iterated until fixed point 1.
- Circle numbers (version 6): a(n) = number of points (i+j/2,j*sqrt(3)/2), i,j integers (triangular grid) contained in a circle of diameter n, centered at (1/2, 1/(2*sqrt(3))).A053479
Circle numbers (version 6): a(n) = number of points (i+j/2,j*sqrt(3)/2), i,j integers (triangular grid) contained in a circle of diameter n, centered at (1/2, 1/(2*sqrt(3))).
- Sum of values when cototient function A051953 is iterated until fixed point is reached.A053480
Sum of values when cototient function A051953 is iterated until fixed point is reached.
- First differences of A029767.A053481
First differences of A029767.
- Binomial transform of A029767.A053482
Binomial transform of A029767.
- Euler transform of A029767.A053483
Euler transform of A029767.
- Numerators in expansion of exp(2x)/(1-x).A053484
Numerators in expansion of exp(2x)/(1-x).
- Denominators in expansion of exp(2x)/(1-x).A053485
Denominators in expansion of exp(2x)/(1-x).
- E.g.f.: exp(3x)/(1-x).A053486
E.g.f.: exp(3x)/(1-x).
- E.g.f.: exp(4x)/(1-x).A053487
E.g.f.: exp(4x)/(1-x).
- E.g.f.: exp(exp(sinh(x))-1)-1.A053488
E.g.f.: exp(exp(sinh(x))-1)-1.
- Expansion of e.g.f.: (1-x)^(-2x).A053489
Expansion of e.g.f.: (1-x)^(-2x).
- Expansion of e.g.f.: (1-x)^(-3x).A053490
Expansion of e.g.f.: (1-x)^(-3x).
- Expansion of e.g.f. (1-2*x)^(-x).A053491
Expansion of e.g.f. (1-2*x)^(-x).
- REVEGF transform of [1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, ...].A053492
REVEGF transform of [1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, ...].
- Number of symmetric 4 X 4 matrices of nonnegative integers with every row and column adding to n.A053493
Number of symmetric 4 X 4 matrices of nonnegative integers with every row and column adding to n.
- Number of symmetric 5 X 5 matrices of nonnegative integers with every row and column adding to n.A053494
Number of symmetric 5 X 5 matrices of nonnegative integers with every row and column adding to n.
- Triangle formed by coefficients of numerator polynomials defined by iterating f(u,v) = 1/u - x*v applied to a list of elements {1,2,3,4,...}.A053495
Triangle formed by coefficients of numerator polynomials defined by iterating f(u,v) = 1/u - x*v applied to a list of elements {1,2,3,4,...}.
- Number of degree-n permutations of order dividing 6.A053496
Number of degree-n permutations of order dividing 6.
- Number of degree-n permutations of order dividing 7.A053497
Number of degree-n permutations of order dividing 7.
- Number of degree-n permutations of order dividing 8.A053498
Number of degree-n permutations of order dividing 8.
- Number of degree-n permutations of order dividing 9.A053499
Number of degree-n permutations of order dividing 9.
- Number of degree-n permutations of order dividing 10.A053500
Number of degree-n permutations of order dividing 10.
- Number of degree-n permutations of order dividing 11.A053501
Number of degree-n permutations of order dividing 11.
- Number of degree-n permutations of order dividing 12.A053502
Number of degree-n permutations of order dividing 12.
- Number of degree-n permutations of order dividing 16.A053503
Number of degree-n permutations of order dividing 16.
- Number of degree-n permutations of order dividing 24.A053504
Number of degree-n permutations of order dividing 24.
- Number of degree-n permutations of order dividing 30.A053505
Number of degree-n permutations of order dividing 30.
- a(n) = (n-1)*n^(n-2).A053506
a(n) = (n-1)*n^(n-2).
- a(n) = binomial(n-1,2)*n^(n-3).A053507
a(n) = binomial(n-1,2)*n^(n-3).
- a(n) = binomial(n-1,3)*n^(n-4).A053508
a(n) = binomial(n-1,3)*n^(n-4).
- a(n) = binomial(n-1,4)*n^(n-5).A053509
a(n) = binomial(n-1,4)*n^(n-5).
- Decimal expansion of log(Pi).A053510
Decimal expansion of log(Pi).