Summary of block A135
Sequences in block A135
Section titled “Sequences in block A135”-
A135030: Generalized Fibonacci numbers: a(n) = 6*a(n-1) + 2*a(n-2).
-
A135032: a(n) = 6*a(n-1) + 4*a(n-2).
-
A135033: Period 5: repeat [2, 4, 6, 8, 0].
-
A135034: Positive integers n repeated 2n-1 times, with a leading a(0) = 0. Also: ceiling of square root of n.
-
A135036: Sums of the products of n consecutive pairs of numbers.
-
A135037: Sums of the products of n consecutive triples of numbers.
-
A135042: a(n) = 5*(n - 1) for n >= 2; a(0) = 1, a(1) = 2.
-
A135043: Duplicate of A054966.
-
A135064: Numbers n such that the quintic polynomial x^5 - 10*n*x^2 - 24*n has Galois group A_5 over rationals.
-
A135066: Primes p such that p^3 is a palindrome.
-
A135092: Binomial transform of [1, 6, 1, 6, 1, 6, …].
-
A135094: a(n) = 2*a(n-1) + 2*a(n-2) - 4*a(n-3) with n>2, a(0)=0, a(1)=1, a(2)=3.
-
A135098: Duplicate of A136488.
-
A135133: a(n) = floor(S2(n)/3) mod 2, where S2(n) denotes the binary weight of n.
-
A135136: a(n) = floor(S2(n)/2) mod 2, where S2(n) is the binary weight of n.
-
A135138: a(n) = 5*a(n-2) + 2*a(n-3).
-
A135139: a(n) = 5*a(n-2) + 2*a(n-3).
-
A135153: Repeat Pell numbers A000129.
-
A135158: a(n) = 5^n - 3^n - 2^n.
-
A135159: a(n) = 5^n - 3^n + 2^n.
-
A135160: a(n) = 5^n + 3^n - 2^n.
-
A135161: a(n) = 7^n - 5^n - 3^n - 2^n. Constants are the prime numbers in decreasing order.
-
A135162: a(n) = 7^n - 5^n - 3^n + 2^n. Constants are the prime numbers in decreasing order.
-
A135163: a(n) = 7^n - 5^n + 3^n - 2^n.
-
A135164: a(n) = 7^n - 5^n + 3^n + 2^n.
-
A135165: a(n) = 7^n + 5^n - 3^n - 2^n.
-
A135166: a(n) = 7^n + 5^n - 3^n + 2^n.
-
A135167: a(n) = 7^n + 5^n + 3^n - 2^n. Constants are the prime numbers in decreasing order.
-
A135168: a(n) = 7^n + 5^n + 3^n + 2^n.
-
A135169: Period 4: repeat [1, 5, 9, 5].
-
A135215: Maximal number of zero digits in square of number with n digits and without zero digits.
-
A135231: Row sums of triangle A135230.
-
A135251: Maximal number of zero digits in square of number with n digits not divisible by 10.
-
A135258: Inverse binomial transform of A131666 after removing A131666(0) = 0.
-
A135263: a(n) = 2*A132357(n).
-
A135265: Period 6: repeat [1, 1, 1, 2, 2, 2].
-
A135276: a(0)=0, a(1)=1; for n>1, a(n) = a(n-1) + n^0 if n odd, a(n) = a(n-1) + n^1 if n is even.
-
A135279: Erroneous version of A005097.
-
A135292: a(n) = 5^n * 4^(n^2).
-
A135300: Positive X-values of solutions to the equation 1!*X^4 - 2!*(X + 1)^3 + 3!*(X + 2)^2 - (4^2)*(X + 3) + 5^2 = Y^3.
-
A135301: a(1)=1, a(n)=a(n-1)+n^0 if n odd, a(n)=a(n-1)+ n^2 if n is even.
-
A135315: a(n) = 8^n * 7^(n^2).
-
A135318: The Kentucky-2 sequence: a(n) = a(n-2) + 2*a(n-4), with a[0..3] = [1, 1, 1, 2].
-
A135320: a(n) = 9^n * 8^(n^2).
-
A135321: a(n) = 10^n * 9^(n^2).
-
A135344: a(n) = 3*a(n-1) - a(n-3) + 3*a(n-4), with initial values 1,1,1,1.
-
A135349: 6^n*5^(n^2).
-
A135351: a(n) = (2^n + 3 - 7*(-1)^n + 3*0^n)/6; or a(0) = 0 and for n > 0, a(n) = A005578(n-1) - (-1)^n.
-
A135361: a(n) = a(n-1)^3 + 1 with a(0) = 0.
-
A135370: a(1)=1; then if n even a(n) = n + a(n-1), if n odd a(n) = 2*n + a(n-1).
-
A135378: Main diagonal of “square and add k” array.
-
A135397: a(n) = 2^n * 3^(n^2).
-
A135398: a(n) = 3^n * 4^(n^2).
-
A135399: a(n) = (-1)^n + (-2)^n + 3^n (-1, -2 and 3 are the roots of the equation x^3 = 7*x + 6).
-
A135400: a(n) = (4*n^4 - 4*n^3 - n^2 + 3*n)/2.
-
A135405: Sequence where the sum of each pair of consecutive elements is a square.
-
A135407: Partial products of A000032 (Lucas numbers beginning at 2).
-
A135408: a(1)=1. a(n) = a(n-1) + a(n-1)^a(n-1).
-
A135415: Van der Waerden numbers for 3-arithmetic progressions with n colors.
-
A135416: a(n) = A036987(n)*(n+1)/2.
-
A135420: a(n) = 4^n * 5^(n^2).
-
A135421: a(n) = 5^n*6^(n^2).
-
A135423: a(n) = (5*9^n + 1)/2.
-
A135425: a(n) = 6^n * 7^(n^2).
-
A135426: a(n) = 7^n * 8^(n^2).
-
A135427: a(n) = 8^n * 9^(n^2).
-
A135438: Denominators (numerators are all 1) of the series: 1/1^2, (1/1^2)*(1/(1^2+2^2)), (1/1^2)*(1/(1^2+2^2))*(1/(1^2+2^2+3^2)), …
-
A135440: a(n) = a(n-1) + 2a(n-2).
-
A135442: Number of partitions into “bus routes” of n X n grid.
-
A135444: Number of partitions into “bus routes” of K_n.
-
A135445: Number of fixed points of N_{2,2}(G_n).
-
A135446: a(n) = 3*a(n-1) - 3*a(n-2) + 2*a(n-3), with a(0) = a(1) = -1 and a(2) = 3.
-
A135448: Period 5: repeat [1, 5, 3, 4, -2].
-
A135449: Period 5: repeat [1, 9, -7, 3, 5].
-
A135453: a(n) = 12*n^2.
-
A135481: a(n) = 2^A007814(n+1) - 1.
-
A135497: a(n) = n^5 - n^2.
-
A135500: Generating function for Viswanath’s constant, using the golden string.
-
A135503: a(n) = n*(n^2 - 1)/2.
-
A135509: Nonnegative integers c such that there are nonnegative integers a and b that satisfy a^(1/2) + b^(1/2) = c^(1/2) and a^2 + b = c.
-
A135511: Number of Pierce-Engel hybrid expansions of 3/b, b>=3.
-
A135518: Generalized repunits in base 15.
-
A135519: Generalized repunits in base 14.
-
A135520: a(n) = 4*a(n-2).
-
A135522: a(n) = 2*a(n-1) + 3*a(n-2), with a(0) = 2 and a(1) = 3.
-
A135528: 1, then repeat 1,0.
-
A135530: a(n) = a(n-1) + 2*a(n-2) - 2*a(n-3), with a(0)=2, a(1)=1.
-
A135532: a(n) = 2*a(n-1) + a(n-2), with a(0)= -1, a(1)= 3.
-
A135536: a(n) = 8*a(n-2), with a(0) = 7, a(1) = 14.
-
A135537: Period 4: repeat [7, 5, 2, 4].
-
A135556: Squares of numbers not divisible by 3: a(n) = A001651(n)^2.
-
A135569: a(n) = S2(n)*2^n; where S2(n) is digit sum of n, n in binary notation.
-
A135576: Numbers whose binary expansion has only the digit “1” as first, central and final digit.
-
A135577: Numbers that have only the digit “1” as first, central and final digit. For numbers with 5 or more digits the rest of digits are “0”.
-
A135583: a(n) = 4*a(n-1) - 4 for n>0, a(0)=3.
-
A135609: a(n) = (n!)^2 - n^n.
-
A135628: Multiples of 28.
-
A135631: Multiples of 31.
-
A135639: a(n) = 839*n.
-
A135640: Powers of 839: a(n) = 839^n.
-
A135659: a(n) = 24*n + 7.
-
A135668: a(n) = ceiling(n + sqrt(n)).
-
A135683: Duplicate of A005451.
-
A135694: Period 6: repeat [1, -1, -1, -1, 0, 2].
-
A135695: Period 6: repeat [-1, -1, -2, -2, 3, 3].
-
A135703: a(n) = n*(7*n-2).
-
A135705: a(n) = 10*binomial(n,2) + 9*n.
-
A135706: a(n) = n*(5*n-3).
-
A135712: a(n) = (4*n^3 + 11*n^2 + 9*n + 2)/2.
-
A135713: a(n) = n*(n+1)*(4*n+1)/2.
-
A135757: Central binomial coefficients at triangular positions: a(n) = A000984(n(n+1)/2).
-
A135758: Catalan numbers at triangular positions: a(n) = A000108(n(n+1)/2).
-
A135826: Moves to permute (ufl,ubr)(ufr,ubl) corners in a 3 X 3 X 3 Rubik’s cube.
-
A135854: a(n) = (n+1)*(2^n+1) for n > 0 with a(0)=1.
-
A135859: Row sums of triangle A135858.
-
A135913: 2+4*2^n-3^n.
-
A135914: a(n) = 4*3^n - 2*2^n - 1.
-
A135916: (n^4 - 10*n^2 + 15*n - 6)/2.
-
A135927: a(n) = a(n-1)^2 - 2 with a(1) = 10.
-
A135947: a(n)=(floor(3*S2(n)/2)) mod 2, where S2(n) is the binary weight of n.
-
A135970: Fibonacci(Mersenne primes): a(n) = Fibonacci(A000668(n)).
-
A135982: a(n) = 2^(24*n+7)-1.
-
A135992: Positive Fibonacci numbers swapped in pairs.