Skip to content

Summary of block A152

142 sequences
  • A152009: (L)-sieve transform of {1,4,7,10,…,3n-2,…} (A016777).

  • A152011: a(0) = 1 and a(n) = (3^n - (-1)^n)/2 for n >= 1.

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

  • A152016: a(n) = n^4 - n^3 - n^2 - n.

  • A152017: a(n) = n^5-n^4-n^3-n^2-n.

  • A152029: a(n) = 2^n*(2*n)!/((n+1)!).

  • A152030: a(n)=n^6-n^5-n^4-n^3-n^2-n.

  • A152031: a(n) = n^5 + n^4 + n^3 + n^2 + n.

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

  • A152035: Expansion of g.f. (1-2*x^2)/(1-2*x-2*x^2).

  • A152041: a(n) = A008893(n)/2.

  • A152046: a(n) = Product_{k=1..floor((n-1)/2)} (1 + 8*cos(k*Pi/n)^2) for n >= 0.

  • A152053: a(n) = A144433(3n+1) + A144433(3n+2) + A144433(3n+3).

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

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

  • A152105: a(n) = (10^n + 6^n)/2.

  • A152106: a(n) = (11^n + 7^n)/2.

  • A152107: a(n) = ((6+sqrt(5))^n+(6-sqrt(5))^n)/2.

  • A152108: a(n) = ((7+sqrt(5))^n + (7-sqrt(5))^n)/2.

  • A152110: G.f.: -2*(-2 - 11*x - 4*x^2 + x^3)/(x - 1)^4.

  • A152113: A001333 with terms repeated.

  • A152121: a(0) = 4; for n>0, a(n) = a(n-1)^2 - 2^(1+2^(n-1)).

  • A152123: 3^a(n) is the order of the free commutative Moufang loop of exponent 3 on n generators.

  • A152132: Maximal length of rook tour on an n X n+1 board.

  • A152133: Maximal length of rook tour on an n X n+2 board.

  • A152134: Maximal length of rook tour on an n X n+3 board.

  • A152135: Maximal length of rook tour on an n X n+4 board.

  • A152161: a(n) = 100*n^2 + 100*n + 21.

  • A152163: a(n) = a(n-1)+a(n-2), n>1 ; a(0)=1, a(1)=-1.

  • A152166: a(2*n) = 2^n; a(2*n+1) = -(2^(n+1)).

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

  • A152174: a(n) = -2*a(n-1)+4*a(n-2), n>1 ; a(0) = 1, a(1) = -4.

  • A152179: (n^2-2=A008865) mod 9. Period 9: repeat 8,2,7,5,5,7,2,8,7.

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

  • A152187: a(n) = 3*a(n-1) + 5*a(n-2), with a(0)=1, a(1)=5.

  • A152223: a(n) = -4*a(n-1) + 6*a(n-2) for n > 1 with a(0) = 1 and a(1) = -6.

  • A152224: a(n)=4*a(n-1)+6*a(n-2), n>1 ; a(0)=1, a(1)=6 .

  • A152239: a(n) = -5*a(n-1) + 7*a(n-2) for n > 1 with a(0) = 1 and a(1) = -7.

  • A152240: a(n)=5*a(n-1)+7*a(n-2), n>1 ; a(0)=1, a(1)=7 .

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

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

  • A152262: a(n) = 14*a(n-1) - 43*a(n-2), n > 1; a(0)=1, a(1)=7.

  • A152268: Expansion of g.f. x/(1-7*x+8*x^2).

  • A152271: a(n)=1 for even n and (n+1)/2 for odd n.

  • A152298: a(n) = (3^n-1)/2 if n odd, (3^n-1)/8 if n even.

  • A152299: A threes sequence that gets more even factors out: a(n)=(3^n - 1)*(3^n + 1)/2^(4 - Mod[n, 2]).

  • A152417: a(n) = (5^n - 1)/(2^(3 - (n mod 2))).

  • A152423: A variation of the Josephus problem, removing every other person, starting with person 1; a(n) is the last person remaining.

  • A152429: a(n) = (11^n + 5^n)/2.

  • A152456: a(n)=1*(n+2)!-2*(n+1)!-3*n!.

  • A152457: Partial sums of A027444.

  • A152458: Numbers k that A064413(k) = k.

  • A152463: Numbers k such that 4 + 5*k^3 is a square.

  • A152467: a(n) = floor(n/6).

  • A152484: Odd numbers which are not the sum of an even semiprime and an odd semiprime.

  • A152491: Numbers n such that 1/c = 1/n + 1/S(n). c, n positive integers (A000027(n)), S(n) sum of digits of n (A007953(n)).

  • A152520: Numbers n such that the decimal expansion of 2^n+5^n contains no 2’s and no 5’s (probably 11 is the last term).

  • A152524: a(n) is the number of L-bit words in which, if up to k bits are perturbed, the resulting change in unsigned L-bit value is n, for L=8 and k=7.

  • A152577: a(n) = 10^(2*n - 1) + 1.

  • A152578: a(n) = 5^(2^(n-1)) + 2.

  • A152579: a(n) = (10*n+3)*(10*n+17).

  • A152580: a(n) = 7^(2^n) + 2.

  • A152581: Generalized Fermat numbers: a(n) = 8^(2^n) + 1, n >= 0.

  • A152582: Numbers of the form 9^(2^n) + 2.

  • A152583: Numbers of the form 11^(2^n) + 2.

  • A152585: Generalized Fermat numbers: 12^(2^n) + 1, n >= 0.

  • A152586: Numbers of the form 13^(2^n) + 2.

  • A152587: Generalized Fermat numbers: a(n) = 14^(2^n) + 1.

  • A152588: 15^(2^n) + 2.

  • A152589: Primes of the form 15^(2^k) + 2.

  • A152591: 17^(2^n) + 2.

  • A152594: a(n) = -5*a(n-1)-2*a(n-2), n>1 ; a(0)=1, a(1)=-1 .

  • A152596: a(n) = 7*a(n-1) - 6*a(n-2), n>1; a(0)=1, a(1)=3.

  • A152599: a(n) = 10*a(n-1) - 12*a(n-2) for n > 1; a(0) = 1, a(1) = 4 .

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

  • A152619: n*(n+2)^2.

  • A152620: a(n)=-8*a(n-1)-6*a(n-2), n>1 ; a(0)=1, a(1)=-2 .

  • A152621: a(n)=8*a(n-1)-6*a(n-2), n>1 ; a(0)=1, a(1)=2.

  • A152623: Decimal expansion of 3/2.

  • A152624: Decimal expansion of 7/2.

  • A152627: Decimal expansion of 3/4.

  • A152653: a(n) = (n-1)! * Product_{k=1..n-2} (n-k)!.

  • A152661: Number of permutations of [n] for which the first two entries have the same parity (n>=2).

  • A152684: a(n) is the number of top-down sequences (F_1, F_2, …, F_n) whereas each F_i is a labeled forest on n nodes, containing i directed rooted trees. F_(i+1) is proper subset of F_i.

  • A152686: Partial products of the partial products of the nonzero Fibonacci numbers.

  • A152687: Partial products operator applied thrice to nonzero Fibonacci numbers.

  • A152690: Partial sums of superfactorials (A000178).

  • A152691: Multiples of 64.

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

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

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

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

  • A152734: 5 times pentagonal numbers: 5*n*(3*n-1)/2.

  • A152740: 11 times triangular numbers.

  • A152741: 13 times triangular numbers.

  • A152742: 13 times the squares: a(n) = 13*n^2.

  • A152743: 6 times pentagonal numbers: a(n) = 3*n*(3*n-1).

  • A152744: 7 times pentagonal numbers: a(n) = 7*n*(3*n-1)/2.

  • A152745: 5 times hexagonal numbers: 5*n*(2*n-1).

  • A152746: Six times hexagonal numbers: 6*n*(2*n-1).

  • A152749: a(n) = (n+1)*(3*n+1)/4 for n odd, a(n) = n*(3*n+2)/4 for n even.

  • A152750: Eight times hexagonal numbers: a(n) = 8*n*(2*n-1).

  • A152751: 3 times octagonal numbers: a(n) = 3*n*(3*n-2).

  • A152756: Bisection of A000533.

  • A152759: 3 times 9-gonal (or nonagonal) numbers: a(n) = 3*n*(7*n-5)/2.

  • A152760: 4 times 9-gonal numbers: a(n) = 2*n*(7*n-5).

  • A152767: 3 times 10-gonal (or decagonal) numbers: a(n) = 3*n*(4*n-3).

  • A152773: 3 times heptagonal numbers: a(n) = 3*n*(5*n-3)/2.

  • A152776: Numbers such that every run length in base 2 is 3.

  • A152777: 7 times heptagonal numbers: a(n) = 7*n*(5*n-3)/2.

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

  • A152813: a(n) = 2*n^2 + 10*n + 3.

  • A152817: Minimum length of n-fold stapled sequence.

  • A152822: Periodic sequence [1,1,0,1] of length 4.

  • A152832: a(0) = -2; a(n) = n - a(n-1) for n > 0.

  • A152833: a(0) = -3; a(n) = n-a(n-1).

  • A152839: a(0) = 0; a(n) = n! - a(n-1)!.

  • A152856: Periodic sequence [4,0,4,3,4] of period 5.

  • A152857: Period 5: repeat [0, 2, 3, 0, 0].

  • A152859: Tower of prime powers: a(n)=prime(n)^a(n-1), a(0)=0.

  • A152873: Number of permutations of {1,2,…,n} (n>=2) having a single run of even entries. For example, the permutation 513284679 has a single run of even entries: 2846.

  • A152885: Number of descents beginning and ending with an odd number in all permutations of {1,2,…,n}.

  • A152887: Number of descents beginning with an even number and ending with an odd number in all permutations of {1,2,…,n}.

  • A152889: Periodic sequence [1,0,4,0,0] of period 5.

  • A152890: Periodic sequence [4,1,4,0,1] of period 5.

  • A152891: a(1) = b(1) = 0; for n > 1, b(n) = b(n-1) + n-1 + a(n-1) and a(n) = a(n-1) + n-1 + b(n).

  • A152892: Period 5: repeat [0, 3, 1, 0, 1].

  • A152893: Periodic sequence [3, 3, 0, 0, 4] of period 5.

  • A152894: Periodic sequence [0,0,1,4,0] of period 5.

  • A152895: Partial sums of A152891.

  • A152898: Periodic sequence [1,4,0,0,0] of period 5.

  • A152915: Exponacci (or exponential Fibonacci) numbers.

  • A152917: A000169 prefixed by an initial 0.

  • A152947: a(n) = 1 + (n-2)*(n-1)/2.

  • A152948: a(n) = (n^2 - 3*n + 6)/2.

  • A152949: a(n) = 3 + binomial(n-1,2).

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

  • A152965: Twice 12-gonal numbers: a(n) = 2*n*(5*n-4).

  • A152994: Nine times hexagonal numbers: a(n) = 9*n*(2*n-1).

  • A152995: Twice 11-gonal numbers: a(n) = n*(9*n-7).

  • A152996: 9 times pentagonal numbers: 9*n*(3*n-1)/2.

  • A152997: Twice 13-gonal numbers: a(n) = n*(11*n - 9).