Summary of block A022
Sequences in block A022
Section titled “Sequences in block A022”-
A022003: Decimal expansion of 1/999.
-
A022026: Define the sequence T(a(0),a(1)) by a(n+2) is the greatest integer such that a(n+2)/a(n+1) < a(n+1)/a(n) for n >= 0. This is T(2,15).
-
A022086: Fibonacci sequence beginning 0, 3.
-
A022087: Fibonacci sequence beginning 0, 4.
-
A022088: Fibonacci sequence beginning 0, 5.
-
A022089: Fibonacci sequence beginning 0, 6.
-
A022090: Fibonacci sequence beginning 0, 7.
-
A022091: Fibonacci sequence beginning 0, 8.
-
A022092: Fibonacci sequence beginning 0, 9.
-
A022093: Fibonacci sequence beginning 0, 10.
-
A022095: Fibonacci sequence beginning 1, 5.
-
A022096: Fibonacci sequence beginning 1, 6.
-
A022097: Fibonacci sequence beginning 1, 7.
-
A022098: Fibonacci sequence beginning 1, 8.
-
A022099: Fibonacci sequence beginning 1, 9.
-
A022100: Fibonacci sequence beginning 1, 10.
-
A022101: Fibonacci sequence beginning 1, 11.
-
A022102: Fibonacci sequence beginning 1, 12.
-
A022103: Fibonacci sequence beginning 1, 13.
-
A022104: Fibonacci sequence beginning 1, 14.
-
A022105: Fibonacci sequence beginning 1, 15.
-
A022106: Fibonacci sequence beginning 1, 16.
-
A022107: Fibonacci sequence beginning 1, 17.
-
A022108: Fibonacci sequence beginning 1, 18.
-
A022109: Fibonacci sequence beginning 1, 19.
-
A022110: Fibonacci sequence beginning 1, 20.
-
A022112: Fibonacci sequence beginning 2, 6.
-
A022113: Fibonacci sequence beginning 2, 7.
-
A022114: Fibonacci sequence beginning 2 9.
-
A022115: Fibonacci sequence beginning 2, 11.
-
A022116: Fibonacci sequence beginning 2, 13.
-
A022117: Fibonacci sequence beginning 2, 15.
-
A022118: Fibonacci sequence beginning 2, 17.
-
A022119: Fibonacci sequence beginning 2, 19.
-
A022120: Fibonacci sequence beginning 3, 7.
-
A022121: Fibonacci sequence beginning 3, 8.
-
A022122: Fibonacci sequence beginning 3, 10.
-
A022123: Fibonacci sequence beginning 3, 11.
-
A022124: Fibonacci sequence beginning 3, 13.
-
A022125: Fibonacci sequence beginning 3, 14.
-
A022126: Fibonacci sequence beginning 3, 16.
-
A022127: Fibonacci sequence beginning 3, 17.
-
A022128: Fibonacci sequence beginning 3, 19.
-
A022129: Fibonacci sequence beginning 3, 20.
-
A022130: Fibonacci sequence beginning 4,9.
-
A022131: Fibonacci sequence beginning 4, 11.
-
A022132: Fibonacci sequence beginning 4, 13.
-
A022133: Fibonacci sequence beginning 4, 15.
-
A022134: Fibonacci sequence beginning 4, 17.
-
A022135: Fibonacci sequence beginning 4, 19.
-
A022136: Fibonacci sequence beginning 5, 11.
-
A022137: Fibonacci sequence beginning 5, 12.
-
A022138: Fibonacci sequence beginning 5, 13.
-
A022139: Fibonacci sequence beginning 5, 14.
-
A022140: Fibonacci sequence beginning 5, 16.
-
A022141: Fibonacci sequence beginning 5, 17.
-
A022142: Fibonacci sequence beginning 5, 18.
-
A022143: Fibonacci sequence beginning 5, 19.
-
A022144: Coordination sequence for root lattice B_2.
-
A022145: Coordination sequence for root lattice B_3.
-
A022220: Gaussian binomial coefficients [ n,2 ] for q = 6.
-
A022264: a(n) = n*(7*n - 1)/2.
-
A022265: a(n) = n*(7*n + 1)/2.
-
A022266: a(n) = n*(9*n - 1)/2.
-
A022267: a(n) = n*(9*n + 1)/2.
-
A022268: a(n) = n*(11*n - 1)/2.
-
A022269: a(n) = n*(11*n+1)/2.
-
A022270: a(n) = n*(13*n - 1)/2.
-
A022271: a(n) = n*(13*n + 1)/2.
-
A022272: a(n) = n*(15*n - 1)/2.
-
A022273: a(n) = n*(15*n + 1)/2.
-
A022274: a(n) = n*(17*n - 1)/2.
-
A022275: a(n) = n*(17*n + 1)/2.
-
A022276: a(n) = n*(19*n - 1)/2.
-
A022277: a(n) = n*(19*n + 1)/2.
-
A022278: a(n) = n*(21*n-1)/2.
-
A022279: a(n) = n*(21*n + 1)/2.
-
A022280: a(n) = n*(23*n - 1)/2.
-
A022281: a(n) = n*(23*n + 1)/2.
-
A022282: a(n) = n*(25*n - 1)/2.
-
A022283: a(n) = n*(25*n + 1)/2.
-
A022284: a(n) = n*(27*n - 1)/2.
-
A022285: a(n) = n*(27*n + 1)/2.
-
A022286: a(n) = n*(29*n - 1)/2.
-
A022287: a(n) = n*(29*n + 1)/2.
-
A022288: a(n) = n*(31*n-1)/2.
-
A022289: a(n) = n*(31*n + 1)/2.
-
A022308: a(n) = a(n-1) + a(n-2) + 1 for n>1, a(0)=0, a(1)=3.
-
A022309: a(n) = a(n-1) + a(n-2) + 1 for n>1, a(0)=0, a(1)=4.
-
A022310: a(n) = a(n-1) + a(n-2) + 1 for n>1, a(0)=0, a(1)=5.
-
A022311: a(n) = a(n-1) + a(n-2) + 1 for n>1, a(0)=0, a(1)=1.
-
A022312: a(n) = a(n-1) + a(n-2) + 1 for n>1, a(0)=0, a(1)=7.
-
A022313: a(n) = a(n-1) + a(n-2) + 1, with a(0) = 0 and a(1) = 8.
-
A022314: a(n) = a(n-1) + a(n-2) + 1, with a(0) = 0, a(1) = 9.
-
A022315: a(n) = a(n-1) + a(n-2) + 1, with a(0) = 0 and a(1) = 10.
-
A022316: a(n) = a(n-1) + a(n-2) + 1, with a(0) = 0 and a(1) = 11.
-
A022317: a(n) = a(n-1) + a(n-2) + 1, with a(0) = 0 and a(1) = 12.
-
A022318: a(n) = a(n-1) + a(n-2) + 1, with a(0) = 1 and a(1) = 4.
-
A022319: a(n) = a(n-1) + a(n-2) + 1 for n > 1, a(0)=1, a(1)=5.
-
A022320: a(n) = a(n-1) + a(n-2) + 1, with a(0) = 1 and a(1) = 6.
-
A022321: a(n) = a(n-1) + a(n-2) + 1, with a(0) = 1 and a(1) = 7.
-
A022322: a(n) = a(n-1) + a(n-2) + 1, with a(0) = 1 and a(1) = 8.
-
A022323: a(n) = a(n-1) + a(n-2) + 1, with a(0) = 1 and a(1) = 9.
-
A022324: a(n) = a(n-1) + a(n-2) + 1, with a(0) = 1 and a(1) = 10.
-
A022325: a(n) = a(n-1) + a(n-2) + 1, with a(0) = 1 and a(1) = 11.
-
A022326: a(n) = a(n-1) + a(n-2) + 1, with a(0) = 1 and a(1) = 12.
-
A022342: Integers with “even” Zeckendorf expansions (do not end with …+F_2 = …+1) (the Fibonacci-even numbers); also, apart from first term, a(n) = Fibonacci successor to n-1.
-
A022345: Fibonacci sequence beginning 0, 11.
-
A022346: Fibonacci sequence beginning 0, 12.
-
A022347: Fibonacci sequence beginning 0, 13.
-
A022348: Fibonacci sequence beginning 0, 14.
-
A022349: Fibonacci sequence beginning 0, 15.
-
A022350: Fibonacci sequence beginning 0, 16.
-
A022351: Fibonacci sequence beginning 0, 17.
-
A022352: Fibonacci sequence beginning 0, 18.
-
A022353: Fibonacci sequence beginning 0, 19.
-
A022354: Fibonacci sequence beginning 0, 20.
-
A022355: Fibonacci sequence beginning 0, 21.
-
A022356: Fibonacci sequence beginning 0, 22.
-
A022357: Fibonacci sequence beginning 0, 23.
-
A022358: Fibonacci sequence beginning 0, 24.
-
A022359: Fibonacci sequence beginning 0, 25.
-
A022360: Fibonacci sequence beginning 0, 26.
-
A022361: Fibonacci sequence beginning 0, 27.
-
A022362: Fibonacci sequence beginning 0, 28.
-
A022363: Fibonacci sequence beginning 0, 29.
-
A022364: Fibonacci sequence beginning 0, 30.
-
A022365: Fibonacci sequence beginning 0, 31.
-
A022366: Fibonacci sequence beginning 0, 32.
-
A022367: Fibonacci sequence beginning 2, 10.
-
A022368: Fibonacci sequence beginning 2, 12.
-
A022369: Fibonacci sequence beginning 2, 14.
-
A022370: Fibonacci sequence beginning 2, 16.
-
A022371: Fibonacci sequence beginning 2, 18.
-
A022372: Fibonacci sequence beginning 2, 20.
-
A022373: Fibonacci sequence beginning 2, 22.
-
A022374: Fibonacci sequence beginning 2, 24.
-
A022375: Fibonacci sequence beginning 2, 26.
-
A022376: Fibonacci sequence beginning 2, 28.
-
A022377: Fibonacci sequence beginning 2, 30.
-
A022378: Fibonacci sequence beginning 2, 32.
-
A022379: Fibonacci sequence beginning 3, 9.
-
A022380: Fibonacci sequence beginning 3, 12.
-
A022381: Fibonacci sequence beginning 3, 15.
-
A022382: Fibonacci sequence beginning 4, 10.
-
A022383: Fibonacci sequence beginning 4, 14.
-
A022384: Fibonacci sequence beginning 4, 18.
-
A022385: Fibonacci sequence beginning 4, 22.
-
A022386: Fibonacci sequence beginning 4, 26.
-
A022387: Fibonacci sequence beginning 4, 30.
-
A022388: Fibonacci sequence beginning 6, 13.
-
A022389: Fibonacci sequence beginning 7, 15.
-
A022390: Fibonacci sequence beginning 8, 17.
-
A022391: Fibonacci sequence beginning 1, 21.
-
A022392: Fibonacci sequence beginning 1, 22.
-
A022393: Fibonacci sequence beginning 1, 23.
-
A022394: Fibonacci sequence beginning 1, 24.
-
A022395: Fibonacci sequence beginning 1, 25.
-
A022396: Fibonacci sequence beginning 1, 26.
-
A022397: Fibonacci sequence beginning 1, 27.
-
A022398: Fibonacci sequence beginning 1, 28.
-
A022399: Fibonacci sequence beginning 1, 29.
-
A022400: Fibonacci sequence beginning 1, 30.
-
A022401: Fibonacci sequence beginning 1, 31.
-
A022402: Fibonacci sequence beginning 1, 32.
-
A022403: a(0)=a(1)=3; thereafter a(n) = a(n-1) + a(n-2) + 1.
-
A022406: a(0)=3, a(1)=7; thereafter a(n) = a(n-1) + a(n-2) + 1.
-
A022407: a(n) = a(n-1) + a(n-2) + 1, with a(0)=3, a(1)=8.
-
A022408: a(n) = a(n-1) + a(n-2) + 1, with a(0)=3, a(1)=9.
-
A022409: a(n) = a(n-1) + a(n-2) + 1, with a(0)=3, a(1)=10.
-
A022410: a(n) = a(n-1) + a(n-2) + 1 for n>1, a(0)=3, a(1)=11.
-
A022411: a(n) = a(n-1) + a(n-2) + 1, with a(0)=3, a(1)=12.
-
A022413: Kim-sums: “Kimberling sums” K_n + K_2.
-
A022441: a(n) = c(n) + c(n-1) where c (A055562) is the sequence of numbers not in a.
-
A022442: a(n) = c(n) + c(n-1) where c is the sequence of numbers not in a.
-
A022521: a(n) = (n+1)^5 - n^5.
-
A022607: Number of topological types of 4-connected n-nodal networks.
-
A022788: Place where n-th 1 occurs in A023126.
-
A022804: a(n) = B(n) + c(n) where B(n) is Beatty sequence [ n*sqrt(2) ] and c is the complement of B.
-
A022838: Beatty sequence for sqrt(3); complement of A054406.
-
A022839: Beatty sequence for sqrt(5).
-
A022842: Beatty sequence for sqrt(8).
-
A022843: Beatty sequence for e: a(n) = floor(n*e).
-
A022846: Nearest integer to n*sqrt(2).
-
A022856: a(n) = n-2 + Sum_{i = 1..n-2} (a(i+1) mod a(i)) for n >= 3 with a(1) = a(2) = 1.
-
A022933: Number of e^m between 2^n and 2^(n+1).
-
A022958: a(n) = 2 - n.
-
A022959: a(n) = 3-n.
-
A022960: a(n) = 4-n.
-
A022961: a(n) = 5-n.
-
A022962: a(n) = 6-n.
-
A022963: a(n) = 7-n.
-
A022964: a(n) = 8-n.
-
A022965: a(n) = 9-n.
-
A022966: a(n) = 10-n.
-
A022967: a(n) = 11-n.
-
A022968: a(n) = 12-n.
-
A022969: a(n) = 13-n.
-
A022970: a(n) = 14-n.
-
A022971: a(n) = 15-n.
-
A022972: a(n) = 16-n.
-
A022973: a(n) = 17-n.
-
A022974: a(n) = 18-n.
-
A022975: a(n) = 19 - n.
-
A022976: a(n) = 20-n.
-
A022977: a(n) = 21-n.
-
A022978: a(n) = 22-n.
-
A022979: a(n) = 23-n.
-
A022980: a(n) = 24-n.
-
A022981: a(n) = 25-n.
-
A022982: a(n) = 26-n.
-
A022983: a(n) = 27 - n.
-
A022984: a(n) = 28-n.
-
A022985: a(n) = 29 - n.
-
A022986: a(n) = 30 - n.
-
A022987: a(n) = 31 - n.
-
A022988: a(n) = 32 - n.
-
A022989: a(n) = 33-n.
-
A022990: a(n) = 34-n.
-
A022991: a(n) = 35-n.
-
A022992: a(n) = 36-n.
-
A022993: a(n) = 37 - n.
-
A022994: a(n) = 38 - n.
-
A022995: a(n) = 39 - n.
-
A022996: a(n) = 40-n.
-
A022998: If n is odd then n, otherwise 2n.