Summary of block A190
Sequences in block A190
Section titled “Sequences in block A190”-
A190005: a(n) = 6*a(n-1) + 10*a(n-2), with a(0)=0, a(1)=1.
-
A190035: Number of nondecreasing arrangements of n+2 numbers in 0..3 with the last equal to 3 and each after the second equal to the sum of one or two of the preceding three.
-
A190050: Expansion of ((1-x)*(3*x^2-3*x+1))/(1-2*x)^3.
-
A190062: a(n) = n*Fibonacci(n) - Sum_{i=0..n-1} Fibonacci(i).
-
A190091: Number of rhombuses on a (n+1) X 3 grid.
-
A190146: Decimal expansion of Sum_{k>=2} (1/Sum_{j=2..k} j’), where n’ is the arithmetic derivative of n.
-
A190176: a(n) = n^4 + 2^4 + (n+2)^4.
-
A190236: a(n) = [n*u + n*v] -[n*u] -[n*v], where u=1/2, v=(1+sqrt(5))/2, and []=floor.
-
A190322: a(1) = 1, a(2) = 9, a(3) = 17; for n>3, a(n) = a(n-3) + 2.
-
A190330: a(n) = n + [n*r/s] + [n*t/s]; r=1, s=sqrt(2), t=1/s.
-
A190331: a(n) = 8*a(n-1) + 2*a(n-2), with a(0)=0, a(1)=1.
-
A190336: a(n) = n + [n*r/s] + [n*t/s]; r=2, s=sqrt(2), t=1/s.
-
A190337: a(n) = n + [n*r/t] + [n*s/t]; r=2, s=sqrt(2), t=1/s.
-
A190440: [(bn+c)r]-b[nr]-[cr], where (r,b,c)=(golden ratio,4,0) and []=floor.
-
A190482: Convex, obtuse, hexagonal lattice numbers.
-
A190505: n+[nr/s]+[nt/s]+[nu/s]; r=golden ratio, s=r+1, t=r+2, u=r+3.
-
A190506: n+[nr/t]+[ns/t]+[nu/t]; r=golden ratio, s=r+1, t=r+2, u=r+3.
-
A190509: a(n) = n + [nr/s] + [nt/s] + [nu/s] where r=golden ratio, s=r^2, t=r^3, u=r^4, and [] represents the floor function.
-
A190510: a(n) = 8*a(n-1) + 4*a(n-2), with a(0)=0, a(1)=1.
-
A190511: n+[nr/u]+[ns/u]+[nt/u]; r=golden ratio, s=r^2, t=r^3, u=r^4.
-
A190525: Number of n-step one-sided prudent walks, avoiding exactly two consecutive west steps (can have three or more west steps).
-
A190539: 2^(n^3).
-
A190540: a(n) = 7^n - 2^n.
-
A190541: a(n) = 7^n - 3^n.
-
A190542: a(n) = 7^n - 4^n.
-
A190543: a(n) = 8^n - 3^n.
-
A190560: a(n) = 8*a(n-1) + 6*a(n-2), with a(0)=0, a(1)=1.
-
A190569: Number of n-step one-sided prudent walks, avoiding single west steps and single east steps.
-
A190576: a(n) = n^2 + 5*n - 5.
-
A190577: a(n) = n*(n+2)*(n+4)*(n+6).
-
A190578: a(n) = n^7 + n.
-
A190621: a(n) = n if n is not divisible by 4, otherwise 0.
-
A190705: a(n) = 6*n^2*(2*n + 1).
-
A190716: a(2*n) = 2*n and a(2*n-1) = A054569(n).
-
A190717: Triplicated tetrahedral numbers A000292.
-
A190718: Quadruplicated tetrahedral numbers A000292.
-
A190719: Numbers that are congruent to {0, 1, 3, 5, 7, 8, 11} mod 12.
-
A190730: Let b(n,0) = n and b(n,k) = 2*b(n,k-1) + 1 for k > 0. Then a(n) = b(n,1) + b(n,2) + … + b(n,n).
-
A190787: Odd powers of 2 and 9 times odd powers of 2, sorted.
-
A190816: a(n) = 5*n^2 - 4*n + 1.
-
A190840: a(n+1) = 4*a(n)*(a(n)+1) for a(0) = 1.
-
A190843: a(n) = [2*n*e] - 2*[n*e], where [ ] = floor and e is the natural logarithm base.
-
A190869: a(n) = 10*a(n-1) - 2*a(n-2), a(0)=0, a(1)=1.
-
A190871: a(n) = 11*a(n-1) - 11*a(n-2), a(0)=0, a(1)=1.
-
A190872: a(n) = 11*a(n-1) - 9*a(n-2), a(0)=0, a(1)=1.
-
A190873: a(n) = 12*a(n-1) - 12*a(n-2), a(0)=0, a(1)=1.
-
A190885: Positions of 3 in A189480.
-
A190893: a(n) = [3en] - 3[en], where [ ] = floor.
-
A190949: Odd Fibonacci numbers with odd index.
-
A190953: a(n) = 8*a(n-1) + 10*a(n-2), with a(0)=0, a(1)=1.
-
A190954: a(n) = 10*a(n-1) + 4*a(n-2), with a(0)=0, a(1)=1.
-
A190955: a(n) = 10*a(n-1) + 5*a(n-2), with a(0)=0, a(1)=1.
-
A190956: a(n) = 10*a(n-1) + 6*a(n-2), with a(0)=0, a(1)=1.
-
A190957: a(n) = 10*a(n-1) + 8*a(n-2), with a(0)=0, a(1)=1.
-
A190959: a(n) = 3*a(n-1) - 5*a(n-2), with a(0)=0, a(1)=1.
-
A190960: a(n) = 3*a(n-1) - 6*a(n-2), with a(0)=0, a(1)=1.
-
A190963: a(n) = 3*a(n-1) - 9*a(n-2), with a(0)=0, a(1)=1.
-
A190965: a(n) = 4*a(n-1) - 6*a(n-2), with a(0)=0, a(1)=1.
-
A190966: a(n) = 4*a(n-1) - 8*a(n-2), with a(0)=0, a(1)=1.
-
A190969: a(n) = 5*a(n-1) - 8*a(n-2), with a(0)=0, a(1)=1.
-
A190971: a(n) = 5*a(n-1) - 10*a(n-2), with a(0)=0, a(1)=1.
-
A190972: a(n) = 7*a(n-1) - 3*a(n-2), with a(0)=0, a(1)=1.
-
A190973: a(n) = 7*a(n-1) - 4*a(n-2), with a(0) = 0, a(1) = 1.
-
A190974: a(n) = 7*a(n-1) - 5*a(n-2), with a(0)=0, a(1)=1.
-
A190975: a(n) = 8*a(n-1) - 2*a(n-2), with a(0)=0, a(1)=1.
-
A190976: a(n) = 8*a(n-1) - 3*a(n-2), with a(0)=0, a(1)=1.
-
A190977: a(n) = 8*a(n-1) - 5*a(n-2), with a(0)=0, a(1)=1.
-
A190978: a(n) = 8*a(n-1) - 6*a(n-2), with a(0)=0, a(1)=1.
-
A190979: a(n) = 9*a(n-1) - 2*a(n-2), with a(0)=0, a(1)=1.
-
A190980: a(n) = 9*a(n-1) - 3*a(n-2), with a(0)=0, a(1)=1.
-
A190981: a(n) = 9*a(n-1) - 4*a(n-2), with a(0)=0, a(1)=1.
-
A190982: a(n) = 9*a(n-1) - 5*a(n-2), with a(0)=0, a(1)=1.
-
A190983: a(n) = 9*a(n-1) - 6*a(n-2), with a(0)=0, a(1)=1.
-
A190984: a(n) = 9*a(n-1) - 7*a(n-2), with a(0)=0, a(1)=1.
-
A190985: a(n) = 10*a(n-1) - 3*a(n-2), with a(0)=0, a(1)=1.
-
A190986: a(n) = 10*a(n-1) - 4*a(n-2), with a(0)=0, a(1)=1.
-
A190987: a(n) = 10*a(n-1) - 5*a(n-2), with a(0)=0, a(1)=1.
-
A190988: a(n) = 10*a(n-1) - 6*a(n-2), with a(0)=0, a(1)=1.
-
A190989: a(n) = 10*a(n-1) - 7*a(n-2), with a(0)=0, a(1)=1.
-
A190990: a(n) = 10*a(n-1) - 8*a(n-2), with a(0)=0, a(1)=1.
-
A190991: a(n) = 13*n + 1.
-
A190994: a(n) = a(n-1) + a(n-2), for n>=2, with a(0)=27, a(1)=2.
-
A190999: a(n) = 2^(n^2)*(2^(2*n+1) - 1).