Summary of block A348
Sequences in block A348
Section titled “Sequences in block A348”-
A348005: Positive even integers with an even number of even divisors.
-
A348133: Minimal number of horizontal and vertical lines needed to partition a square into rectangles which can be reassembled into n distinct squares.
-
A348143: Areas of integer-sided cyclic quadrilaterals whose area equals their perimeter.
-
A348149: Variation of the Barnyard sequence A347581: a(n) is the minimum number of unit-length line segments required to enclose areas of 1 through n on a square grid when the number of segments is minimized as each area of incrementing size, starting at 1, is added.
-
A348232: Partial sums of A348231.
-
A348240: a(n) = Sum_{k = 1..floor(n/2)} A003041(n-2*k).
-
A348257: Number of ways we can write [n] as the union of 2 sets of sizes i, j which intersect in exactly 2 elements (2 < i,j < n; i = j allowed).
-
A348312: a(n) = n! * Sum_{k=0..n-1} 3^k / k!.
-
A348314: a(n) = n! * Sum_{k=0..n-1} 4^k / k!.
-
A348339: a(n) is the number of distinct numbers of steps required for the last n digits of integers to repeat themselves by iterating the map m -> m^2.
-
A348365: Number of connected realizable graphs on n vertices.
-
A348407: a(n) = ((n+1)*3*2^(n+1) + 29*2^n + (-1)^n)/9.
-
A348461: Size of largest bipartite biregular Moore graph of diameter 4 and degrees n and n.
-
A348462: Size of largest bipartite biregular Moore graph of diameter 6 and degrees n and 2.
-
A348463: Size of largest bipartite biregular Moore graph of diameter 6 and degrees n and n.
-
A348464: Turan numbers T(n,6,4).
-
A348484: Maximum number of squares on an n X n chessboard such that no two are two steps apart horizontally or vertically.
-
A348537: Number of partitions of n into 3 parts whose largest part divides n.
-
A348574: Length of the shortest string over the alphabet {1,…,n} such that every subset of {1,…,n} appears as a substring (in some order).
-
A348589: a(n) = (10^n+2)^2 / 6.
-
A348591: a(n) = L(n)*L(n+1) mod F(n+2) where F=A000045 is the Fibonacci numbers and L = A000032 is the Lucas numbers.
-
A348618: a(n) = (1+(-1)^n)/2*4^n*(C((3*n)/2-1,n))+(1-(-1)^n)/2*((C((3*n-1)/2,n))*(C(3*n-1,(3*n-1)/2)))/(C(n-1,(n-1)/2)).
-
A348621: The number of additions required to compute the permanent of general n X n matrices using Ryser’s formula without Gray code ordering.
-
A348638: Minimal order of a graph containing as induced subgraphs isomorphic copies of all trees on n unlabeled nodes.
-
A348759: (43200/719)*{a(n)} are the times, measured in seconds from 00:00:00, at which the angle of the sector enclosing the three hands of an analog clock has a local minimum.
-
A348776: The numbers >= 2 with 3 repeated.
-
A348845: Part two of the trisection of A017101: a(n) = 11 + 24*n.