Skip to content

Summary of block A100

133 sequences
  • A100019: a(n) = n^4 + n^3 + n^2.

  • A100033: Bisection of A001700.

  • A100037: Positions of occurrences of the natural numbers as a second subsequence in A100035.

  • A100038: Positions of occurrences of the natural numbers as third subsequence in A100035.

  • A100039: Positions of occurrences of the natural numbers as fourth subsequence in A100035.

  • A100040: a(n) = 2*n^2 + n - 5.

  • A100041: a(n) = 2*n^2 + n - 7.

  • A100043: a(n) = (3*n-1)!.

  • A100050: A Chebyshev transform of n.

  • A100051: A Chebyshev transform of 1,1,1,…

  • A100052: A Chebyshev transform of the odd numbers.

  • A100062: Denominator of the probability that an integer n occurs in the cumulative sums of the decimal digits of a random real number between 0 and 1.

  • A100063: A Chebyshev transform of Jacobsthal numbers.

  • A100088: Expansion of (1-x^2)/((1-2*x)*(1+x^2)).

  • A100089: a(n) = (3*n+1)!.

  • A100102: a(n) = 2^(2*n)-(2*n-1).

  • A100103: a(n) = 2^(2*n) - 2*n.

  • A100104: a(n) = n^3 - n^2 + 1.

  • A100109: a(n) = n^3 - 2*n^2 + 2.

  • A100119: a(n) = n-th centered n-gonal number.

  • A100131: a(n) = Sum_{k=0..floor(n/4)} binomial(n-2k, 2k)*2^(n-4k).

  • A100147: Structured icosidodecahedral numbers.

  • A100148: Structured small rhombicosidodecahedral numbers.

  • A100153: Structured truncated dodecahedral numbers.

  • A100155: Structured truncated octahedral numbers.

  • A100157: Structured rhombic dodecahedral numbers (vertex structure 9).

  • A100162: Structured disdyakis dodecahedral numbers (vertex structure 7).

  • A100164: Structured rhombic triacontahedral numbers (vertex structure 11).

  • A100165: Structured rhombic triacontahedral numbers (vertex structure 7).

  • A100167: Structured pentagonal icositetrahedral numbers (vertex structure 13).

  • A100171: Structured triakis octahedral numbers (vertex structure 4).

  • A100172: Structured triakis icosahedral numbers (vertex structure 4).

  • A100174: Structured tetrakis hexahedral numbers (vertex structure 5).

  • A100175: Structured triakis tetrahedral numbers (vertex structure 4).

  • A100176: Structured octagonal prism numbers.

  • A100177: Structured meta-prism numbers, the n-th number from a structured n-gonal prism number sequence.

  • A100178: Structured hexagonal diamond numbers (vertex structure 5).

  • A100179: Structured heptagonal diamond numbers (vertex structure 5).

  • A100182: Structured tetragonal anti-prism numbers.

  • A100185: Structured meta-anti-prism numbers, the n-th number from a structured n-gonal anti-prism number sequence.

  • A100186: Structured heptagonal anti-diamond numbers (vertex structure 7).

  • A100187: Structured octagonal anti-diamond numbers (vertex structure 7).

  • A100188: Polar structured meta-anti-diamond numbers, the n-th number from a polar structured n-gonal anti-diamond number sequence.

  • A100189: Equatorial structured meta-anti-diamond numbers, the n-th number from an equatorial structured n-gonal anti-diamond number sequence.

  • A100206: Row sums of Clark’s triangle A046902.

  • A100207: a(n) = 4 + 8*n + 10*n^2 + 4*n^3.

  • A100214: a(n) = 4*n^3 + 4.

  • A100215: Expansion of (4 - 7*x + 2*x^2)/((1-2*x)*(1 - 2*x + 2*x^2)).

  • A100219: Expansion of (1-2*x)/((1-x)*(1-x+x^2)).

  • A100227: Main diagonal of triangle A100226.

  • A100230: Main diagonal of triangle A100229.

  • A100233: a(n) = Lucas(3*n) - 1.

  • A100236: Main diagonal of triangle A100235.

  • A100237: Secondary diagonal of triangle A100235 divided by row number: a(n) = A100235(n+1,n)/(n+1) for n >= 0.

  • A100242: a(n) = n^5 - n^2*(n^2 - 1)/2.

  • A100255: Squares of pentagonal numbers: a(n) = (1/4)*n^2*(3*n-1)^2.

  • A100256: Squares of second pentagonal numbers: a(n) = (1/4)*n^2*(3*n+1)^2.

  • A100283: a(n) = floor(p*(n+1)) - floor(p*(n)) - 1 where p = Padovan plastic number = 1.324718… (cf. A060006).

  • A100284: Expansion of (1-4*x-x^2)/((1-x)*(1-4*x-5*x^2)).

  • A100285: Expansion of (1+5*x^2)/(1-x+x^2-x^3).

  • A100286: Expansion of (1+2*x^2-2*x^3+2*x^4)/(1-x+x^2-x^3+x^4-x^5).

  • A100302: Expansion of (1 - x - 6*x^2)/((1 - x)*(1 - x - 8*x^2)).

  • A100303: Expansion of (1 - x - 4*x^2)/(1 - x - 8*x^2).

  • A100304: Expansion of (1 - x - 6*x^2)/(1 - x - 8*x^2).

  • A100305: Expansion of (1 - x - 4*x^2)/(1 - 2*x - 7*x^2 + 8*x^3).

  • A100312: Number of 3 X n binary matrices avoiding simultaneously the right angled numbered polyomino patterns (ranpp) (10;0) and (01;1).

  • A100314: Number of 2 X n 0-1 matrices avoiding simultaneously the right angled numbered polyomino patterns (ranpp) (00;1), (01;0), (10;0) and (01;1).

  • A100316: Number of 4 X n 0-1 matrices avoiding simultaneously the right angled numbered polyomino patterns (ranpp) (00;1), (01;0), (10;0) and (01;1).

  • A100320: A Catalan transform of (1 + 2*x)/(1 - 2*x).

  • A100321: The trinomial transform (A027907) gives powers of 2, while the trinomial transform of this sequence shift one place left gives powers of 3.

  • A100335: An inverse Catalan transform of J(2n).

  • A100351: Numbers n such that n-2^k is a semiprime for all k > 0 with 2^k < n.

  • A100381: a(n) = 2^n*binomial(n,2).

  • A100399: a(n) = Fibonacci(n)^n.

  • A100401: Digital root of 3^n.

  • A100402: Digital root of 4^n.

  • A100403: Digital root of 6^n.

  • A100404: a(n) = L(n) * n! where L(n) are the Lucas numbers.

  • A100409: Numbers n such that n is d_1*d_2*…*d_k-th composite number (n=A002808(d_1*d_2*…*d_k)) where d_1 d_2 … d_k is the decimal expansion of n.

  • A100412: a(n) = 8*10^n - 7.

  • A100413: Numbers k such that k is reversal(k)-th even composite number (k is A004086(k)-th even composite number).

  • A100430: Bisection of A002417.

  • A100431: Bisection of A002417.

  • A100444: Bisection of A000255.

  • A100455: a(n) = 2^n + sin(n*Pi/2).

  • A100470: n appears A055642(n) times (appearances equal number of decimal digits).

  • A100503: Bisection of A000125.

  • A100504: a(n) = (4*n^3 + 6*n^2 + 8*n + 6)/3.

  • A100511: a(n) = Sum_{j=0..n} Sum_{k=0..n} binomial(n,j)*binomial(n,k)*max(j,k).

  • A100523: a(n) = a(n-1)^2 + 2*a(n-1) - 1 with a(0) = 1.

  • A100525: Bisection of A048654.

  • A100530: Numbers == 0,2,5,9 modulo 10.

  • A100531: a(n) = a(n-1) + (2*n - 1) mod 8 + 1 with a(0)=1.

  • A100536: a(n) = 3*n^2 - 2.

  • A100545: Expansion of (7-2*x) / (1-3*x+x^2).

  • A100575: Half the number of permutations of 0..n with exactly two maxima.

  • A100583: Number of triangles in an n X n grid of squares with diagonals.

  • A100585: a(n+1) = a(n)+floor(a(n)/3), a(1) = 3.

  • A100586: Write down the numbers from 3 to infinity. Take next number, M say, that has not been crossed off. Counting through the numbers that have not yet been crossed off after that M, cross off every 5th term. Repeat, always crossing off every 5th term of those that remain. The numbers that are left form the sequence.

  • A100595: Numbers k such that (prime(k)-1)! + prime(k)^9 is prime.

  • A100598: Numbers k such that (prime(k)-1)! + prime(k)^8 is prime.

  • A100599: Numbers k such that (prime(k)-1)! + prime(k)^7 is prime.

  • A100605: Numbers k such that (prime(k)-1)! + prime(k)^2 is prime.

  • A100606: a(n) = n^4 + n^3 + n.

  • A100617: There are n people in a room. The first half (i.e., floor(n/2)) of them leave, then 1/3 (i.e., floor of 1/3) of those remaining leave, then 1/4, then 1/5, etc.; sequence gives number who remain at the end.

  • A100659: Floor of measure (in degrees) of the internal angles of a regular polygon with n sides.

  • A100679: Floor of cube root of tetrahedral numbers.

  • A100680: a(n) = 2^(n^n).

  • A100701: a(n) = a(n-1) + a(n-2) + a(n-1)*a(n-2) for n>=2; a(0)=2, a(1)=3.

  • A100702: Number of layers of dough separated by butter in successive foldings of croissant dough.

  • A100703: (T(n-1) + T(n-2)) + T(n-1)*T(n-2) where T(0)=3, T(1)=5 and n >= 2.

  • A100704: a(n) = (a(n-1) + a(n-2)) * a(n-1) * a(n-2) with a(0)=1 and a(1)=1.

  • A100705: a(n) = n^3 + (n+1)^2.

  • A100706: Bisection of A002275.

  • A100731: a(n) = 3^(n!).

  • A100732: a(n) = (3*n)!.

  • A100733: a(n) = (4*n)!.

  • A100734: a(n) = (5*n)!.

  • A100747: A modular recurrence.

  • A100764: a(1) = 1, a(2) = 2, a(3) = 3, a(n) = least number not the sum of three or fewer previous terms.

  • A100774: a(n) = 2*(3^n - 1).

  • A100775: a(n) = 97*n + 101.

  • A100776: a(n) = 997*n + 1009.

  • A100795: n occurs n times, as early as possible subject to the constraint that no two successive terms are identical.

  • A100828: Expansion of (1+2*x-2*x^3-3*x^2)/((x-1)*(x+1)*(x^2+2*x-1)).

  • A100832: Amenable numbers: n such that there exists a multiset of integers (s(1), …, s(n)) whose size, sum and product are all n.

  • A100838: Numbers k such that k^k + 7 is prime.

  • A100839: Numbers k such that k^k + 10 is prime.

  • A100855: a(n) = n*(n^3-n^2+n+1)/2.

  • A100886: Expansion of x*(1+3*x+2*x^2)/((1+x+x^2)*(1-x-x^2)).

  • A100888: Expansion of (3+x-x^2)/((1+x+x^2)(1-x-x^2)).

  • A100893: a(n) = smallest n-digit prime formed by appending a digit to a(n-1); a(1) = 2.

  • A100931: F(n!) * L(n!) where F(n) are Fibonacci numbers and L(n) are Lucas numbers.