Sequences

a(n)=number of Gaussian integers z=a+bi satisfying |z|<=n+1/2, a>0, b>=0.

Erroneous version of A036706.

a(n)=number of Gaussian integers z=a+bi satisfying |z|<=n+1/2, a>=0, 0<=b<a.

a(n)=number of Gaussian integers z=a+bi satisfying n-1/2<|z|<=n+1/2, a>=0, 0<=b<a.

a(n)=number of Gaussian integers z=a+bi satisfying |z|<=n+1/2, a>=0, 0<=b<=a.

a(n)=number of Gaussian integers z=a+bi satisfying n-1/2<|z|<=n+1/2, a>=0, 0<=b<=a.

G.f. satisfies A(x) = 1 + x*cycle_index(Alt(4), A(x)).

Number of rooted trees where each node has at most 4 children.

G.f. satisfies A(x) = 1 + x*cycle_index(Cyclic(4), A(x)).

G.f. satisfies A(x) = 1 + x*cycle_index(Klein_4_group, A(x)).

G.f. satisfies A(x) = 1 + x*cycle_index(Sym(5), A(x)).

G.f. satisfies A(x) = 1 + x*cycle_index(Sym(6), A(x)).

G.f. satisfies A(x) = 1 + x*cycle_index(G,A(x)) where G = cyclic group of order 2 generated by (1,2)(3,4).

G.f. satisfies A(x) = 1 + x*cycle_index(G,A(x)) where G = cyclic group of order 2 generated by (1,2)(3,4)(5,6).

G.f. satisfies A(x) = 1 + x*cycle_index(G,A(x)) where G = cyclic group of order 2 generated by (1,2)(3,4)(5,6)(7,8).

G.f. satisfies A(x) = 1 + x*cycle_index(G,A(x)) where G = cyclic group of order 3 generated by (1,2,3)(4,5,6).

G.f. satisfies A(x) = 1 + x*cycle_index(G,A(x)) where G = cyclic group of order 5 generated by (1,2,3,4,5).

G.f. satisfies A(x) = 1 + x*cycle_index(G,A(x)) where G = cyclic group of order 7 generated by (1,2,...,7).

G.f. satisfies A(x) = 1 + x*cycle_index(G,A(x)) where G = cyclic group of order 11 generated by (1,2,...,11).

G.f. satisfies A(x) = 1 + x*cycle_index(G,A(x)) where G = cyclic group of order 13 generated by (1,2,...,13).

G.f. satisfies A(x) = 1 + x*cycle_index(G,A(x)) where G = cyclic group of order 17 generated by (1,2,...,17).

G.f. satisfies A(x) = 1 + x*cycle_index(G,A(x)) where G = cyclic group of order 19 generated by (1,2,...,19).

G.f. satisfies A(x) = 1 + x*cycle_index(G,A(x)) where G = cyclic group of order 23 generated by (1,2,...,23).

G.f. satisfies A(x) = 1 + x*cycle_index(G,A(x)) where G = cyclic group of order 29 generated by (1,2,...,29).

G.f. satisfies A(x) = 1 + x*cycle_index(G,A(x)) where G = cyclic group of order 31 generated by (1,2,...,31).

G.f. satisfies A(x) = 1 + x*cycle_index(G,A(x)) where G = cyclic group of order 37 generated by (1,2,...,37).

G.f. satisfies A(x) = 1 + x*cycle_index(G,A(x)) where G = cyclic group of order 41 generated by (1,2,...,41).

G.f. satisfies A(x) = 1 + x*cycle_index(G,A(x)) where G = cyclic group of order 43 generated by (1,2,...,43).

a(n) = (n!)^n+1.

a(n) = (n!)^n.

Values increase, Roman numerals increase lexicographically.

Numbers <= 3999 sorted in Roman numeral lexicographic order.

Numbers <= 3999 sorted in Roman numeral reverse lexicographic order.

Penholodigital squares: squares containing each of the digits 1..9 exactly once.

Squares including each digit exactly once.

Numbers with "long" representations in Roman notation: given by last n letters from ...MMMDCCCLXXXVIII.

The numbers 0-100 in English lexicographic order.

Number of strings of n distinct digits from 0-9 that are the last n digits of a square in base 6.

Number of strings of n distinct digits from 0-9 that are the last n digits of a square in base 7.

Number of strings of n distinct digits from 1-9 that are the last n digits of a square in base 7.

Number of strings of n distinct digits from 0-9 that are the last n digits of a square in base 8.

Number of strings of n distinct digits from 1-9 that are the last n digits of a square in base 8.

Number of strings of n distinct digits from 0-9 that are the last n digits of a square in base 9.

Number of strings of n distinct digits from 1-9 that are the last n digits of a square in base 9.

Number of strings of n distinct digits from 0-9 that are the last n digits of a square in base 10.

Number of strings of n distinct digits from 1-9 that are the last n digits of a square in base 10.

Number of tree-like heptagonal systems.

Number of edge-rooted tree-like octagonal systems.

Number of mirror-symmetrical edge-rooted tree-like octagonal systems.

Number of tree-like octagonal systems.