Skip to content

Summary of block A304

81 sequences
  • A304025: a(n) is the largest integer that can be written with n digits in base 3/2.

  • A304041: Number of inequivalent solutions to problem in A054961.

  • A304157: a(n) is the first Zagreb index of the linear phenylene G[n], defined pictorially in the Darafsheh reference.

  • A304158: a(n) is the second Zagreb index of the linear phenylene G[n], defined pictorially in the Darafsheh reference (Fig. 3).

  • A304159: a(n) = 2*n^3 - 4*n^2 + 6*n - 2 (n>=1).

  • A304160: a(n) = n^4 - 3*n^3 + 6*n^2 - 5*n + 2 (n >= 1).

  • A304161: a(n) = 2*n^3 - 4*n^2 + 10*n - 2 (n>=1).

  • A304162: a(n) = n^4 - 3*n^3 + 9*n^2 - 7*n + 5 (n>=1).

  • A304163: a(n) = 9*n^2 - 3*n + 1 with n>0.

  • A304164: a(n) = 27*n^2 - 21*n + 6 (n>=1).

  • A304165: a(n) = 324*n^2 - 336*n + 102 (n >= 1).

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

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

  • A304171: a(n) = 87*2^n - 38 (n>=0).

  • A304172: a(n) = 99*2^n - 45 (n>=0).

  • A304205: Numbers k such that 24*k + 6 is congruent to 0 (mod 49).

  • A304273: The concatenation of the first n terms is the smallest positive even number with n digits when written in base 3/2 (cf. A024629).

  • A304274: The concatenation of the first n elements is the largest positive even number with n digits when written in base 3/2.

  • A304370: Number of function calls of the first kind required to compute ack(3,n), where ack denotes the Ackermann function.

  • A304374: a(n) = 9*n^2 + 21*n - 6 (n>=1).

  • A304375: a(n) = 27*n^2/2 + 45*n/2 - 12 (n>=1).

  • A304376: a(n) = 60*2^n - 48 (n>=1).

  • A304377: a(n) = 102*2^n - 96 (n>=1).

  • A304378: a(n) = 4*(n - 1)*(16*n - 23) for n >= 1.

  • A304380: a(n) = 36*n^2 - 4*n (n>=1).

  • A304381: a(n) = 54*n^2 - 26*n + 4 (n>=1).

  • A304383: a(n) = 36*2^n - 5 (n>=1).

  • A304384: a(n) = 168*2^n - 26 (n>=1).

  • A304385: a(n) = 192*2^n - 31 (n>=1).

  • A304387: a(n) = 27*2^n - 5.

  • A304388: a(n) = 144*2^n - 20 (n>=1).

  • A304389: a(n) = 126*2^n - 22 (n>=1).

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

  • A304498: Solution (b(n)) of the system of complementary equations defined in Comments.

  • A304503: a(n) = 3*(n+1)*(9*n+4).

  • A304504: a(n) = 3*(3*n+1)*(9*n+8)/2.

  • A304505: a(n) = 4*(n+1)*(9*n+4).

  • A304506: a(n) = 2*(3*n+1)*(9*n+8).

  • A304507: a(n) = 5*(n+1)*(9*n+4).

  • A304509: a(n) = 63*2^n - 39 (n>=1).

  • A304510: a(n) = 69*2^n - 42 (n>=1).

  • A304513: a(n) = 57*2^(n-1) - 38 (n >= 1).

  • A304514: a(n) = 33*2^n - 45 (n>=1).

  • A304515: a(n) = 159*2^n - 222 (n>=1).

  • A304516: a(n) = 192*2^n - 273 (n>=1).

  • A304517: a(n) = 16*2^n - 11 (n>=1).

  • A304518: a(n) = 68*2^n - 50 (n>=1).

  • A304519: a(n) = 72*2^n -56 (n>=1).

  • A304577: Period 21: repeat (0,0,0,0,1,1,1,1,1,0,1,0,1,0,0,1,1,0,0,0,1).

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

  • A304588: Length of shortest prefix of the Thue-Morse word (A010060) such that some length-n block appears twice.

  • A304605: a(n) = 48*2^n + 26 (n>=1).

  • A304606: a(n) = 54*2^n + 28 (n >= 1).

  • A304608: a(n) = 288*2^n + 178 (n >= 1).

  • A304609: a(n) = 114*n - 20.

  • A304610: a(n) = 157*n - 40 (n>=1).

  • A304611: a(n) = 155*n - 38.

  • A304612: a(n) = 75*2^n - 38.

  • A304613: a(n) = 87*2^n - 45.

  • A304614: a(n) = 420*2^n - 222.

  • A304618: a(n) = 108*n^2 - 228*n + 114 (n>=2).

  • A304659: a(n) = n*(n + 1)*(16*n - 1)/6.

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

  • A304725: a(n) = n^4 + 8*n^3 + 20*n^2 + 16*n + 2.

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

  • A304780: Consider a triangle whose first row is {1,2} and, for n > 1, has as its n-th row the integers k through 2k where k is the sum of the numbers in the (n-1)th row. Then a(n) is the first number in the n-th row.

  • A304809: Solution (a(n)) of the complementary equation a(n) = b(2n) + b(4n) ; see Comments.

  • A304810: Solution (b(n)) of the complementary equation a(n) = b(2n) + b(4n) ; see Comments.

  • A304826: a(n) = 32*7^n/21 - 8/3, n>=1.

  • A304827: a(n) = 52*7^n/21 - 16/3 (n>=1).

  • A304830: a(n) = 102*2^n - 108 (n>=1).

  • A304831: a(n) = 123*2^n - 135.

  • A304832: a(n) = n^2 + 25*n - 34 (n >=2).

  • A304833: a(n) = 3*n^2 + 38*n - 76 (n>=2).

  • A304834: a(n) = 36*n^2 - 8*n - 2 (n >=1).

  • A304835: a(n) = 108*n^2 - 104*n + 20 (n>=1).

  • A304836: a(n) = 27*n^2 - 51*n + 24, n>=1.

  • A304839: a(n) = 61*n - 38 (n>=1).

  • A304840: a(n) = 52*n - 2 (n>=1).

  • A304841: a(n) = 67*n - 10 (n>=1).

  • A304993: a(n) = n*(n + 1)*(7*n + 5)/6.