Skip to content

Summary of block A139

115 sequences
  • A139011: Real part of (2 + i)^n, where i = sqrt(-1).

  • A139098: a(n) = 8*n^2.

  • A139149: a(n) = (n!+2)/2.

  • A139150: a(n) = (n!+3)/3.

  • A139151: a(n) = (n!+4)/4.

  • A139152: a(n) = (n!+5)/5.

  • A139153: a(n) = (n!+6)/6.

  • A139155: a(n) = (n!+8)/8.

  • A139157: a(n) = (n!+10)/10.

  • A139172: a(n) = n!/2 - 1.

  • A139173: a(n) = n!/3 - 1.

  • A139174: a(n) = (n!-4)/4.

  • A139175: a(n) = (n! - 5)/5.

  • A139176: a(n) = (n! - 6)/6.

  • A139179: Number of non-fourth-powers <= n.

  • A139183: a(n) = (n! - 8)/8.

  • A139185: a(n) = (n! - 10)/10.

  • A139209: Fibonacci bisection minus powers of 2.

  • A139222: a(n) = 30*n - 27.

  • A139244: a(0) = 4; a(n) = a(n-1)^2 - 1.

  • A139245: a(n) = 20*n - 16.

  • A139249: a(n) = 30*n - 24.

  • A139264: a(n) = 70*n - 63.

  • A139267: Twice octagonal numbers: 2*n*(3*n-2).

  • A139268: Twice nonagonal numbers (or twice 9-gonal numbers): a(n) = n*(7*n-5).

  • A139271: a(n) = 2*n*(4*n-3).

  • A139272: a(n) = n*(8*n-5).

  • A139273: a(n) = n*(8*n - 3).

  • A139274: a(n) = n*(8*n-1).

  • A139275: a(n) = n*(8*n+1).

  • A139276: a(n) = n*(8*n+3).

  • A139277: a(n) = n*(8*n+5).

  • A139278: a(n) = n*(8*n+7).

  • A139279: a(n) = 40*n - 32.

  • A139280: a(n) = 90*n - 81.

  • A139297: a(n) = 2^(2p - 1)/2-1, where p is the n-th Mersenne prime A000668(n).

  • A139338: Least k > 0 such that Sum_{i=0..2*n-1} (-k)^i/i! < 0.

  • A139378: Number of 2-digit multiples of n whose digits sum to n.

  • A139464: n! + 2n - 1.

  • A139473: a(n)=((2*Sqrt[2] + 3)^(2^(n - 1) - 1) - (3 - 2*Sqrt[2])^(2^(n - 1) - 1))/(4*Sqrt[2]).

  • A139482: Binomial transform of [1, 1, 2, 1, -1, 1, -1, 1, -1, 1, -1, 1, -1, …].

  • A139486: a(n) = Product_{j=0..n-1} (2^j + 2).

  • A139488: Binomial transform of [1, 2, 3, 4, 0, 0, 0, …].

  • A139541: There are 4*n players who wish to play bridge at n tables. Each player must have another player as partner and each pair of partners must have another pair as opponents. The choice of partners and opponents can be made in exactly a(n)=(4*n)!/(n!*8^n) different ways.

  • A139544: Numbers which are not the difference of two squares of positive integers.

  • A139570: a(n) = 2*n*(n+3).

  • A139576: a(n) = n*(2*n + 9).

  • A139577: a(n) = n*(2*n + 11).

  • A139578: a(n) = n*(2*n + 13).

  • A139579: a(n) = 2*n^2 + 15*n.

  • A139580: a(n) = n*(2*n + 17).

  • A139581: a(n) = n*(2*n + 19).

  • A139591: A139275(n) followed by 18-gonal number A051870(n+1).

  • A139592: A033585(n) followed by A139271(n+1).

  • A139593: A139276(n) followed by A139272(n+1).

  • A139595: A139277(n) followed by A139273(n+1).

  • A139596: A033587(n) followed by even hexagonal number A014635(n+1).

  • A139597: A139278(n) followed by A139274(n+1).

  • A139598: A035008(n) followed by A139098(n+1).

  • A139606: a(n) = 15*n + 6.

  • A139607: a(n) = 21*n + 7.

  • A139608: a(n) = 28*n + 8.

  • A139609: a(n) = 36*n + 9.

  • A139610: a(n) = 45*n + 10.

  • A139611: a(n) = 55*n + 11.

  • A139612: a(n) = 66*n + 12.

  • A139613: a(n) = 78*n + 13.

  • A139614: a(n) = 91*n + 14.

  • A139615: a(n) = 105*n + 15.

  • A139616: a(n) = 120*n + 16.

  • A139617: a(n) = 136*n + 17.

  • A139618: a(n) = 153*n + 18.

  • A139619: a(n) = 171*n + 19.

  • A139620: a(n) = 190*n + 20.

  • A139626: a(n) = binomial(n+4, 4)*6^n.

  • A139628: Row sums of A139623, number of directed multigraphs with loops and no vertex of degree 0, with n arcs, which are transitive (the existence of a path between two points implies the existence of an arc between those two points).

  • A139629: Row sums of A139624, number of connected directed multigraphs with loops and no vertex of degree 0, with n arcs, which are transitive (the existence of a path between two points implies the existence of an arc between those two points).

  • A139634: a(n) = 10*2^(n-1) - 9.

  • A139635: Binomial transform of [1, 11, 11, 11, …].

  • A139641: a(n) = binomial(n+4, 4)*7^n.

  • A139697: Binomial transform of [1, 12, 12, 12, …].

  • A139698: Binomial transform of [1, 25, 25, 25, …].

  • A139700: Binomial transform of [1, 30, 30, 30, …].

  • A139701: Binomial transform of [1, 100, 100, 100, …].

  • A139704: Nearly palindromic numbers: non-palindromes that can be made palindromic by inserting an extra digit.

  • A139729: 9^n mod 4^n.

  • A139730: a(n) = 9^n mod 5^n.

  • A139731: a(n) = 9^n mod 6^n.

  • A139732: a(n) = 9^n mod 7^n.

  • A139733: 9^n mod 8^n.

  • A139734: a(n) = 10^n mod 3^n.

  • A139735: a(n) = 10^n mod 4^n.

  • A139736: a(n) = 10^n mod 6^n.

  • A139737: a(n) = 10^n mod 7^n.

  • A139738: a(n) = 10^n mod 8^n.

  • A139739: a(n) = 10^n mod 9^n.

  • A139740: a(n) = 11^n - 2^n.

  • A139741: a(n) = 11^n - 3^n.

  • A139742: a(n) = 11^n - 4^n.

  • A139743: a(n) = 11^n - 5^n.

  • A139744: a(n) = 11^n - 6^n.

  • A139745: a(n) = 11^n - 7^n.

  • A139746: a(n) = 11^n - 8^n.

  • A139747: a(n) = 11^n - 9^n.

  • A139754: a(n) = floor(n*2*(3^n-2^n)/2^n).

  • A139756: Binomial transform of A004526.

  • A139757: a(n) = (n+1)*(2n+1)^2.

  • A139760: First quadrisection of A115451.

  • A139782: Binomial transform of A077947.

  • A139786: a(n) = 7^n mod 6^n.

  • A139788: Period 5: repeat [1, 7, 3, 9, 5].

  • A139792: First quadrisection of A139763 (1, 2, 3, 4, 11, …).

  • A139806: a(n) = a(n-1)+a(n-2)+a(n-3)+2*a(n-4), a(0)=1, a(1)=3, a(2)=7, a(3)=15.

  • A139817: 2^n - number of digits of 2^n.

  • A139818: Squares of Jacobsthal numbers.