chunky v0.11.4 Chunky.Sequence.OEIS.Core View Source

OEIS Sequence A000085 - Number of self-inverse permutations on n letters, also known as involutions; number of standard Young tableaux with n cells.

create_sequence_a000105(opts)

OEIS Sequence A000105 - Number of free polyominoes (or square animals) with n cells.

create_sequence_a000108(opts)

OEIS Sequence A000108 - Catalan numbers: C(n) = binomial(2n,n)/(n+1) = (2n)!/(n!(n+1)!). Also called Segner numbers.

create_sequence_a000109(opts)

OEIS Sequence A000109 - Number of simplicial polyhedra with n nodes

create_sequence_a000110(opts)

OEIS Sequence A000110 - Bell or exponential numbers: number of ways to partition a set of n labeled elements.

create_sequence_a000111(opts)

OEIS Sequence A000111 - Euler or up/down numbers: e.g.f. sec(x) + tan(x). Also for n >= 2, half the number of alternating permutations on n letters (A001250).

create_sequence_a000112(opts)

OEIS Sequence A000112 - Number of partially ordered sets ("posets") with n unlabeled elements.

create_sequence_a000120(opts)

OEIS Sequence A000120 - 1's-counting sequence: number of 1's in binary expansion of n (or the binary weight of n).

create_sequence_a000124(opts)

OEIS Sequence A000124 - Central polygonal numbers (the Lazy Caterer's sequence): n(n+1)/2 + 1; or, maximal number of pieces formed when slicing a pancake with n cuts.

create_sequence_a000129(opts)

OEIS Sequence A000129 - Pell numbers: a(0) = 0, a(1) = 1; for n > 1, a(n) = 2*a(n-1) + a(n-2).

create_sequence_a000142(opts)

OEIS Sequence A000142 - Factorial numbers: n! = 1234...*n

create_sequence_a000166(opts)

OEIS Sequence A000166 - Subfactorial or rencontres numbers, or derangements: number of permutations of n elements with no fixed points.

create_sequence_a000169(opts)

OEIS Sequence A000169 - Number of labeled rooted trees with n nodes: n^(n-1).

create_sequence_a000203(opts)

OEIS Sequence A000203 - Sum of Divisors σ1(n)

create_sequence_a000204(opts)

OEIS Sequence A000204 - Lucas numbers (beginning with 1)

create_sequence_a000217(opts)

OEIS Sequence A000217 - Triangular numbers: a(n) = binomial(n+1,2)

create_sequence_a000219(opts)

OEIS Sequence A000219 - Number of planar partitions (or plane partitions) of n.

create_sequence_a000225(opts)

OEIS Sequence A000225 - a(n) = 2^n - 1. (Sometimes called Mersenne numbers, although that name is usually reserved for A001348.)

create_sequence_a000244(opts)

OEIS Sequence A000244 - Powers of 3.

create_sequence_a000262(opts)

OEIS Sequence A000262 - Number of "sets of lists"

create_sequence_a000272(opts)

OEIS Sequence A000272 - Number of trees on n labeled nodes: n^(n-2) with a(0)=1.

create_sequence_a000290(opts)

OEIS Sequence A000290 - The squares: a(n) = n^2.

create_sequence_a000292(opts)

OEIS Sequence A000292 - Tetrahedral (or triangular pyramidal) numbers: a(n) = C(n+2,3) = n(n+1)(n+2)/6.

create_sequence_a000302(opts)

OEIS Sequence A000302 - Powers of 4: a(n) = 4^n.

create_sequence_a000312(opts)

OEIS Sequence A000312 - a(n) = n^n; number of labeled mappings from n points to themselves (endofunctions).

create_sequence_a000326(opts)

OEIS Sequence A000326 - Pentagonal numbers: a(n) = n(3n-1)/2.

create_sequence_a000330(opts)

OEIS Sequence A000330 - Square pyramidal numbers: a(n) = 0^2 + 1^2 + 2^2 + ... + n^2 = n(n+1)(2*n+1)/6.

create_sequence_a000364(opts)

OEIS Sequence A000364 - Euler (or secant or "Zig") numbers: e.g.f. (even powers only) sec(x) = 1/cos(x).

create_sequence_a000396(opts)

OEIS Sequence A000396 - Perfect Numbers

create_sequence_a000521(opts)

OEIS Sequence A000521 - Coefficients of modular function j as power series in q = e^(2 Pi i t)

create_sequence_a000578(opts)

OEIS Sequence A000578 - The cubes: a(n) = n^3.

create_sequence_a000583(opts)

OEIS Sequence A000583 - Fourth powers: a(n) = n^4

create_sequence_a000593(opts)

OEIS Sequence A000593 - Sum of Odd Divisors of N

create_sequence_a000594(opts)

OEIS Sequence A000594 - Ramanujan's tau function

create_sequence_a000609(opts)

OEIS Sequence A000609 - Number of threshold functions of n or fewer variables.

create_sequence_a000670(opts)

OEIS Sequence A000670 - Fubini numbers: number of preferential arrangements of n labeled elements; or number of weak orders on n labeled elements; or number of ordered partitions of [n].

create_sequence_a000688(opts)

OEIS Sequence A000688 - Number of Abelian groups of order n

create_sequence_a000720(opts)

OEIS Sequence A000720 - pi(n), the number of primes <= n

create_sequence_a000796(opts)

OEIS Sequence A000796 - Decimal expansion of Pi (or digits of Pi).

create_sequence_a000798(opts)

OEIS Sequence A000798 - Number of different quasi-orders (or topologies, or transitive digraphs) with n labeled elements.

create_sequence_a000959(opts)

OEIS Sequence A000959 - Lucky numbers.

create_sequence_a000961(opts)

OEIS Sequence A000961 - Powers of primes. Alternatively, 1 and the prime powers (p^k, p prime, k >= 1).

create_sequence_a000984(opts)

OEIS Sequence A000984 - Central binomial coefficients: binomial(2n,n) = (2n)!/(n!)^2.

create_sequence_a001003(opts)

OEIS Sequence A001003 - Schroeder's second problem (generalized parentheses); also called super-Catalan numbers or little Schroeder numbers.

create_sequence_a001006(opts)

OEIS Sequence A001006 - Motzkin numbers

create_sequence_a001045(opts)

OEIS Sequence A001045 - Jacobsthal sequence (or Jacobsthal numbers)

create_sequence_a001055(opts)

OEIS Sequence A001055 - The multiplicative partition function: number of ways of factoring n with all factors greater than 1 (a(1) = 1 by convention).

create_sequence_a001065(opts)

OEIS Sequence A001065 - Sum of proper divisors (Aliquot parts) of N.

create_sequence_a001157(opts)

OEIS Sequence A001157 - Sum of squares of divisors of N, simga-2(n), 𝝈2(n).

create_sequence_a001190(opts)

OEIS Sequence A001190 - Wedderburn-Etherington numbers: unlabeled binary rooted trees (every node has out-degree 0 or 2) with n endpoints (and 2n-1 nodes in all).

create_sequence_a001221(opts)

OEIS Sequence A001221 - Number of distinct primes dividing n (also called omega(n)).

create_sequence_a001222(opts)

OEIS Sequence A001222 - Number of prime divisors of n counted with multiplicity (also called bigomega(n) or Omega(n)).

create_sequence_a001227(opts)

OEIS Sequence A001227 - Number of odd divisors of n.

create_sequence_a001358(opts)

OEIS Sequence A001358 - Semiprimes (or biprimes): products of two primes.

create_sequence_a001477(opts)

OEIS Sequence A001477 - The nonnegative integers.

create_sequence_a001489(opts)

OEIS Sequence A001489 - a(n) = -n.

create_sequence_a001511(opts)

OEIS Sequence A001511 - The ruler function: 2^a(n) divides 2n

create_sequence_a001615(opts)

OEIS Sequence A001615 - Dedekind psi function: n * Product_{p|n, p prime} (1 + 1/p).

create_sequence_a002106(opts)

OEIS Sequence A002106 - Number of transitive permutation groups of degree n.

create_sequence_a002654(opts)

OEIS Sequence A002654 - Number of ways of writing n as a sum of at most two nonzero squares, where order matters

create_sequence_a002808(opts)

OEIS Sequence A002808 - The composite numbers: numbers n of the form x*y for x > 1 and y > 1.

create_sequence_a003094(opts)

OEIS Sequence A003094 - Number of unlabeled connected planar simple graphs with n nodes.

create_sequence_a003484(opts)

OEIS Sequence A003484 - Radon function, also called Hurwitz-Radon numbers.

create_sequence_a005100(opts)

OEIS Sequence A005100 - Deficient Numbers

create_sequence_a005101(opts)

OEIS Sequence A005101 - Abundant Numbers

create_sequence_a005117(opts)

OEIS Sequence A005117 - Squarefree numbers: numbers that are not divisible by a square greater than 1.

create_sequence_a005470(opts)

OEIS Sequence A005470 - Number of unlabeled planar simple graphs with n nodes.

create_sequence_a005843(opts)

OEIS Sequence A005843 - The nonnegative even numbers: a(n) = 2n.

create_sequence_a006530(opts)

OEIS Sequence A006530 - Gpf(n): greatest prime dividing n

create_sequence_a006966(opts)

OEIS Sequence A006966 - Number of lattices on n unlabeled nodes.

create_sequence_a008292(opts)

OEIS Sequence A008292 - Triangle of Eulerian numbers T(n,k) (n >= 1, 1 <= k <= n) read by rows.

create_sequence_a008683(opts)

OEIS Sequence A008683 - Möbius (or Moebius) function mu(n)

create_sequence_a020639(opts)

OEIS Sequence A020639 - Lpf(n): least prime dividing

create_sequence_a055512(opts)

OEIS Sequence A055512 - Lattices with n labeled elements.

create_sequence_fibonacci(opts)

seq_a000002(atom, data, arg3)

seq_a000004(idx)

seq_a000005(idx)

seq_a000007(idx)

seq_a000009(idx)

seq_a000010(idx)

seq_a000012(idx)

seq_a000027(idx)

seq_a000032(idx)

seq_a000035(idx)

seq_a000040(idx, last)

seq_a000041(idx)

seq_a000045(idx, a, b)

seq_a000069(idx, last)

seq_a000079(idx)

seq_a000081(idx)

seq_a000085(idx)

seq_a000108(idx)

seq_a000110(idx)

seq_a000111(idx)

seq_a000120(idx)

seq_a000124(idx)

seq_a000129(idx)

seq_a000142(idx)

seq_a000166(idx)

seq_a000169(idx)

seq_a000203(idx)

seq_a000204(idx)

seq_a000217(idx)

seq_a000219(idx)

seq_a000225(idx)

seq_a000244(idx)

seq_a000262(idx)

seq_a000272(idx)

seq_a000290(idx)

seq_a000292(idx)

seq_a000302(idx)

seq_a000312(idx)

seq_a000326(idx)

seq_a000330(idx)

seq_a000364(idx)

seq_a000521(idx)

seq_a000578(idx)

seq_a000583(idx)

seq_a000593(idx)

seq_a000594(idx)

seq_a000670(idx)

seq_a000688(idx)

seq_a000720(idx, last)

seq_a000796(atom, data, arg3)

seq_a000959(atom, data, v)

seq_a000961(idx, last)

seq_a000984(idx)

seq_a001003(idx)

seq_a001006(idx)

seq_a001045(idx)

seq_a001055(idx)

seq_a001065(idx)

seq_a001157(idx)

seq_a001190(idx)

seq_a001221(idx)

seq_a001222(idx)

seq_a001227(idx)

seq_a001358(idx, last)

seq_a001477(idx)

seq_a001489(idx)

seq_a001511(idx)

seq_a001615(idx)

seq_a002654(idx)

seq_a002808(idx, last)

seq_a003484(idx)

seq_a005100(idx, last)

seq_a005101(idx, last)

seq_a005117(idx, last)

seq_a005843(idx)

seq_a006530(idx)

seq_a008292(idx)

seq_a008683(idx)

seq_a020639(idx)

Link to this section Functions

create_sequence_a000001(opts)

OEIS Sequence A000001 - Number of groups of order n.

From OEIS A000001:

Number of groups of order n. (Formerly M0098 N0035)

Sequence IDs: :a000001

Finite: False

Offset: 0

Example

iex> Sequence.create(Elixir.Chunky.Sequence.OEIS.Core, :a000001) |> Sequence.take!(94)
[0,1,1,1,2,1,2,1,5,2,2,1,5,1,2,1,14,1,5,1,5,2,2,1,15,2,2,5,4,1,4,1,51,1,2,1,14,1,2,2,14,1,6,1,4,2,2,1,52,2,5,1,5,1,15,2,13,2,2,1,13,1,2,4,267,1,4,1,5,1,4,1,50,1,2,3,4,1,6,1,52,15,2,1,15,1,2,1,12,1,10,1,4,2]

create_sequence_a000002(opts)

OEIS Sequence A000002 - Kolakoski sequence

From OEIS A000002:

Kolakoski sequence: a(n) is length of n-th run; a(1) = 1; sequence consists just of 1's and 2's. (Formerly M0190 N0070)

Sequence IDs: :a000002

Finite: False

Offset: 1

Example

iex> Sequence.create(Elixir.Chunky.Sequence.OEIS.Core, :a000002) |> Sequence.take!(108)
[1,2,2,1,1,2,1,2,2,1,2,2,1,1,2,1,1,2,2,1,2,1,1,2,1,2,2,1,1,2,1,1,2,1,2,2,1,2,2,1,1,2,1,2,2,1,2,1,1,2,1,1,2,2,1,2,2,1,1,2,1,2,2,1,2,2,1,1,2,1,1,2,1,2,2,1,2,1,1,2,2,1,2,2,1,1,2,1,2,2,1,2,2,1,1,2,1,1,2,2,1,2,1,1,2,1,2,2]

create_sequence_a000004(opts)

OEIS Sequence A000004 - The zero sequence.

From OEIS A000004:

The zero sequence. (Formerly M0000)

Sequence IDs: :a000004

Finite: False

Offset: 0

Example

iex> Sequence.create(Elixir.Chunky.Sequence.OEIS.Core, :a000004) |> Sequence.take!(102)
[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]

create_sequence_a000005(opts)

OEIS Sequence A000005 - Number of divisors of N, simga-0(n), 𝝈0(n).

From OEIS A000005:

d(n) (also called tau(n) or sigma_0(n)), the number of divisors of n. (Formerly M0246 N0086)

Sequence IDs: :a000005

Finite: False

Offset: 1

Example

iex> Sequence.create(Sequence.OEIS.Core, :a000005) |> Sequence.take!(10)
[1, 2, 2, 3, 2, 4, 2, 4, 3, 4]

create_sequence_a000007(opts)

OEIS Sequence A000007 - The characteristic function of {0}: a(n) = 0^n.

From OEIS A000007:

The characteristic function of {0}: a(n) = 0^n. (Formerly M0002)

Sequence IDs: :a000007

Finite: False

Offset: 0

Example

iex> Sequence.create(Elixir.Chunky.Sequence.OEIS.Core, :a000007) |> Sequence.take!(105)
[1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]

create_sequence_a000009(opts)

OEIS Sequence A000009 - Number of partitions of n into distinct parts

From OEIS A000009:

Expansion of Product_{m >= 1} (1 + x^m); number of partitions of n into distinct parts; number of partitions of n into odd parts (if n > 0). (Formerly M0281 N0100)

Divergence

Calculation of this sequence is based on translation of a Maxima program by Vladimir Kruchinin, and diverges from canonical results for n > 10.

Sequence IDs: :a000009

Finite: False

Offset: 0

Example

iex> Sequence.create(Sequence.OEIS.Core, :a000009) |> Sequence.take!(10)
[1, 1, 1, 2, 2, 3, 4, 5, 6, 8]

create_sequence_a000010(opts)

OEIS Sequence A000010 - Euler's totient function phi(n)

From OEIS A000010:

Euler totient function phi(n): count numbers <= n and prime to n. (Formerly M0299 N0111)

Sequence IDs: :a000010

Finite: false

Example

iex> Sequence.create(Sequence.OEIS.Core, :a000010) |> Sequence.take!(20)
[1, 1, 2, 2, 4, 2, 6, 4, 6, 4, 10, 4, 12, 6, 8, 8, 16, 6, 18, 8]

create_sequence_a000012(opts)

OEIS Sequence A000012 - The simplest sequence of positive numbers: the all 1's sequence.

From OEIS A000012:

The simplest sequence of positive numbers: the all 1's sequence. (Formerly M0003)

Sequence IDs: :a000012

Finite: False

Offset: 0

Example

iex> Sequence.create(Elixir.Chunky.Sequence.OEIS.Core, :a000012) |> Sequence.take!(90)
[1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1]

create_sequence_a000027(opts)

OEIS Sequence A000027 - The positive integers

From OEIS A000027:

The positive integers. Also called the natural numbers, the whole numbers or the counting numbers, but these terms are ambiguous. (Formerly M0472 N0173)

Sequence IDs: :a000027

Finite: False

Offset: 1

Example

iex> Sequence.create(Elixir.Chunky.Sequence.OEIS.Core, :a000027) |> Sequence.take!(77)
[1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77]

create_sequence_a000032(opts)

OEIS Sequence A000032 - Lucas numbers beginning at 2: L(n) = L(n-1) + L(n-2), L(0) = 2, L(1) = 1.

From OEIS A000032:

Lucas numbers beginning at 2: L(n) = L(n-1) + L(n-2), L(0) = 2, L(1) = 1. (Formerly M0155)

Sequence IDs: :a000032

Finite: False

Offset: 0

Example

iex> Sequence.create(Elixir.Chunky.Sequence.OEIS.Core, :a000032) |> Sequence.take!(39)
[2,1,3,4,7,11,18,29,47,76,123,199,322,521,843,1364,2207,3571,5778,9349,15127,24476,39603,64079,103682,167761,271443,439204,710647,1149851,1860498,3010349,4870847,7881196,12752043,20633239,33385282,54018521,87403803]

create_sequence_a000035(opts)

OEIS Sequence A000035 - Period 2: repeat [0, 1]

From OEIS A000035:

Period 2: repeat [0, 1]; a(n) = n mod 2; parity of n. (Formerly M0001)

Sequence IDs: :a000035

Finite: False

Offset: 0

Example

iex> Sequence.create(Elixir.Chunky.Sequence.OEIS.Core, :a000035) |> Sequence.take!(105)
[0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]

create_sequence_a000040(opts)

OEIS Sequence A000040 - The prime numbers.

From OEIS A000040:

The prime numbers. (Formerly M0652 N0241)

Sequence IDs: :a000040

Finite: False

Offset: 1

Example

iex> Sequence.create(Elixir.Chunky.Sequence.OEIS.Core, :a000040) |> Sequence.take!(58)
[2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97,101,103,107,109,113,127,131,137,139,149,151,157,163,167,173,179,181,191,193,197,199,211,223,227,229,233,239,241,251,257,263,269,271]

create_sequence_a000041(opts)

OEIS Sequence A000041 - Partitions of integer N

This sequence contains the partitions of the integers from 0 to 250.

From Wikipedia:

In number theory, the partition function p(n) represents the number of possible partitions of a non-negative integer n. For instance, p(4) = 5 because the integer 4 has the five partitions: 1 + 1 + 1 + 1, 1 + 1 + 2, 1 + 3, 2 + 2, and 4.

From OEIS A000041:

a(n) is the number of partitions of n (the partition numbers). (Formerly M0663 N0244)

Sequence IDs: :a000041

Finite: true

Example

iex> Sequence.create(Sequence.OEIS.Core, :a000041) |> Sequence.take!(10)
[1, 1, 2, 3, 5, 7, 11, 15, 22, 30]

create_sequence_a000043(opts)

OEIS Sequence A000043 - Mersenne exponents: primes p such that 2^p - 1 is prime

From OEIS A000043:

Mersenne exponents: primes p such that 2^p - 1 is prime. Then 2^p - 1 is called a Mersenne prime. (Formerly M0672 N0248)

Sequence IDs: :a000043

Finite: False

Offset: 1

Example

iex> Sequence.create(Elixir.Chunky.Sequence.OEIS.Core, :a000043) |> Sequence.take!(47)
[2,3,5,7,13,17,19,31,61,89,107,127,521,607,1279,2203,2281,3217,4253,4423,9689,9941,11213,19937,21701,23209,44497,86243,110503,132049,216091,756839,859433,1257787,1398269,2976221,3021377,6972593,13466917,20996011,24036583,25964951,30402457,32582657,37156667,42643801,43112609]

create_sequence_a000045(opts)

OEIS Sequence A000045 - Fibonacci numbers

From OEIS A000045

Fibonacci numbers: F(n) = F(n-1) + F(n-2) with F(0) = 0 and F(1) = 1. (Formerly M0692 N0256)

Sequence IDs: :a000045, :fibonacci

Finite: false

Example

iex> Sequence.create(Sequence.OEIS.Core, :a000045) |> Sequence.take!(10)
[0, 1, 1, 2, 3, 5, 8, 13, 21, 34]

create_sequence_a000069(opts)

OEIS Sequence A000069 - Odious numbers: numbers with an odd number of 1's in their binary expansion.

From OEIS A000069:

Odious numbers: numbers with an odd number of 1's in their binary expansion. (Formerly M1031 N0388)

Sequence IDs: :a000069

Finite: False

Offset: 1

Example

iex> Sequence.create(Elixir.Chunky.Sequence.OEIS.Core, :a000069) |> Sequence.take!(65)
[1,2,4,7,8,11,13,14,16,19,21,22,25,26,28,31,32,35,37,38,41,42,44,47,49,50,52,55,56,59,61,62,64,67,69,70,73,74,76,79,81,82,84,87,88,91,93,94,97,98,100,103,104,107,109,110,112,115,117,118,121,122,124,127,128]

create_sequence_a000079(opts)

OEIS Sequence A000079 - Powers of 2 a(n) = 2^n

From OEIS A000009:

Powers of 2: a(n) = 2^n. (Formerly M1129 N0432)

Sequence IDs: :a000079

Finite: False

Offset: 0

Example

iex> Sequence.create(Sequence.OEIS.Core, :a000079) |> Sequence.take!(20)
[1, 2, 4, 8, 16, 32, 64, 128, 256, 512, 1024, 2048, 4096, 8192, 16384, 32768, 65536, 131072, 262144, 524288]

create_sequence_a000081(opts)

OEIS Sequence A000081 - Number of unlabeled rooted trees with n nodes

From OEIS A000081:

Number of unlabeled rooted trees with n nodes (or connected functions with a fixed point). (Formerly M1180 N0454)

Sequence IDs: :a000081

Finite: False

Offset: 0

Example

iex> Sequence.create(Elixir.Chunky.Sequence.OEIS.Core, :a000081) |> Sequence.take!(31)
[0,1,1,2,4,9,20,48,115,286,719,1842,4766,12486,32973,87811,235381,634847,1721159,4688676,12826228,35221832,97055181,268282855,743724984,2067174645,5759636510,16083734329,45007066269,126186554308,354426847597]

create_sequence_a000085(opts)

OEIS Sequence A000085 - Number of self-inverse permutations on n letters, also known as involutions; number of standard Young tableaux with n cells.

From OEIS A000085:

Number of self-inverse permutations on n letters, also known as involutions; number of standard Young tableaux with n cells. (Formerly M1221 N0469)

Sequence IDs: :a000085

Finite: False

Offset: 0

Example

iex> Sequence.create(Elixir.Chunky.Sequence.OEIS.Core, :a000085) |> Sequence.take!(28)
[1,1,2,4,10,26,76,232,764,2620,9496,35696,140152,568504,2390480,10349536,46206736,211799312,997313824,4809701440,23758664096,119952692896,618884638912,3257843882624,17492190577600,95680443760576,532985208200576,3020676745975552]

create_sequence_a000105(opts)

OEIS Sequence A000105 - Number of free polyominoes (or square animals) with n cells.

From OEIS A000105:

Number of free polyominoes (or square animals) with n cells. (Formerly M1425 N0561)

Sequence IDs: :a000105

Finite: False

Offset: 0

Example

iex> Sequence.create(Elixir.Chunky.Sequence.OEIS.Core, :a000105) |> Sequence.take!(29)
[1,1,1,2,5,12,35,108,369,1285,4655,17073,63600,238591,901971,3426576,13079255,50107909,192622052,742624232,2870671950,11123060678,43191857688,168047007728,654999700403,2557227044764,9999088822075,39153010938487,153511100594603]

create_sequence_a000108(opts)

OEIS Sequence A000108 - Catalan numbers: C(n) = binomial(2n,n)/(n+1) = (2n)!/(n!(n+1)!). Also called Segner numbers.

From OEIS A000108:

Catalan numbers: C(n) = binomial(2n,n)/(n+1) = (2n)!/(n!(n+1)!). Also called Segner numbers. (Formerly M1459 N0577)

Sequence IDs: :a000108

Finite: False

Offset: 0

Example

iex> Sequence.create(Elixir.Chunky.Sequence.OEIS.Core, :a000108) |> Sequence.take!(31)
[1,1,2,5,14,42,132,429,1430,4862,16796,58786,208012,742900,2674440,9694845,35357670,129644790,477638700,1767263190,6564120420,24466267020,91482563640,343059613650,1289904147324,4861946401452,18367353072152,69533550916004,263747951750360,1002242216651368,3814986502092304]

create_sequence_a000109(opts)

OEIS Sequence A000109 - Number of simplicial polyhedra with n nodes

From OEIS A000109:

Number of simplicial polyhedra with n nodes; simple planar graphs with 3n-6 edges; maximal simple planar graphs; 3-connected planar triangulations; 3-connected triangulations of the sphere; 3-connected cubic planar graphs. (Formerly M1469 N0580)

Sequence IDs: :a000109

Finite: False

Offset: 3

Example

iex> Sequence.create(Elixir.Chunky.Sequence.OEIS.Core, :a000109) |> Sequence.take!(21)
[1,1,1,2,5,14,50,233,1249,7595,49566,339722,2406841,17490241,129664753,977526957,7475907149,57896349553,453382272049,3585853662949,28615703421545]

create_sequence_a000110(opts)

OEIS Sequence A000110 - Bell or exponential numbers: number of ways to partition a set of n labeled elements.

From OEIS A000110:

Bell or exponential numbers: number of ways to partition a set of n labeled elements. (Formerly M1484 N0585)

Sequence IDs: :a000110

Finite: False

Offset: 0

Example

iex> Sequence.create(Elixir.Chunky.Sequence.OEIS.Core, :a000110) |> Sequence.take!(27)
[1,1,2,5,15,52,203,877,4140,21147,115975,678570,4213597,27644437,190899322,1382958545,10480142147,82864869804,682076806159,5832742205057,51724158235372,474869816156751,4506715738447323,44152005855084346,445958869294805289,4638590332229999353,49631246523618756274]

create_sequence_a000111(opts)

OEIS Sequence A000111 - Euler or up/down numbers: e.g.f. sec(x) + tan(x). Also for n >= 2, half the number of alternating permutations on n letters (A001250).

From OEIS A000111:

Euler or up/down numbers: e.g.f. sec(x) + tan(x). Also for n >= 2, half the number of alternating permutations on n letters (A001250). (Formerly M1492 N0587)

Sequence IDs: :a000111

Finite: False

Offset: 0

Example

iex> Sequence.create(Elixir.Chunky.Sequence.OEIS.Core, :a000111) |> Sequence.take!(27)
[1,1,1,2,5,16,61,272,1385,7936,50521,353792,2702765,22368256,199360981,1903757312,19391512145,209865342976,2404879675441,29088885112832,370371188237525,4951498053124096,69348874393137901,1015423886506852352,15514534163557086905,246921480190207983616,4087072509293123892361]

create_sequence_a000112(opts)

OEIS Sequence A000112 - Number of partially ordered sets ("posets") with n unlabeled elements.

From OEIS A000112:

Number of partially ordered sets ("posets") with n unlabeled elements. (Formerly M1495 N0588)

Sequence IDs: :a000112

Finite: False

Offset: 0

Example

iex> Sequence.create(Elixir.Chunky.Sequence.OEIS.Core, :a000112) |> Sequence.take!(17)
[1,1,2,5,16,63,318,2045,16999,183231,2567284,46749427,1104891746,33823827452,1338193159771,68275077901156,4483130665195087]

create_sequence_a000120(opts)

OEIS Sequence A000120 - 1's-counting sequence: number of 1's in binary expansion of n (or the binary weight of n).

From OEIS A000120:

1's-counting sequence: number of 1's in binary expansion of n (or the binary weight of n). (Formerly M0105 N0041)

Sequence IDs: :a000120

Finite: False

Offset: 0

Example

iex> Sequence.create(Elixir.Chunky.Sequence.OEIS.Core, :a000120) |> Sequence.take!(105)
[0,1,1,2,1,2,2,3,1,2,2,3,2,3,3,4,1,2,2,3,2,3,3,4,2,3,3,4,3,4,4,5,1,2,2,3,2,3,3,4,2,3,3,4,3,4,4,5,2,3,3,4,3,4,4,5,3,4,4,5,4,5,5,6,1,2,2,3,2,3,3,4,2,3,3,4,3,4,4,5,2,3,3,4,3,4,4,5,3,4,4,5,4,5,5,6,2,3,3,4,3,4,4,5,3]

create_sequence_a000124(opts)

OEIS Sequence A000124 - Central polygonal numbers (the Lazy Caterer's sequence): n(n+1)/2 + 1; or, maximal number of pieces formed when slicing a pancake with n cuts.

From OEIS A000124:

Central polygonal numbers (the Lazy Caterer's sequence): n(n+1)/2 + 1; or, maximal number of pieces formed when slicing a pancake with n cuts. (Formerly M1041 N0391)

Sequence IDs: :a000124

Finite: False

Offset: 0

Example

iex> Sequence.create(Elixir.Chunky.Sequence.OEIS.Core, :a000124) |> Sequence.take!(53)
[1,2,4,7,11,16,22,29,37,46,56,67,79,92,106,121,137,154,172,191,211,232,254,277,301,326,352,379,407,436,466,497,529,562,596,631,667,704,742,781,821,862,904,947,991,1036,1082,1129,1177,1226,1276,1327,1379]

create_sequence_a000129(opts)

OEIS Sequence A000129 - Pell numbers: a(0) = 0, a(1) = 1; for n > 1, a(n) = 2*a(n-1) + a(n-2).

From OEIS A000129:

Pell numbers: a(0) = 0, a(1) = 1; for n > 1, a(n) = 2*a(n-1) + a(n-2). (Formerly M1413 N0552)

Sequence IDs: :a000129

Finite: False

Offset: 0

Example

iex> Sequence.create(Elixir.Chunky.Sequence.OEIS.Core, :a000129) |> Sequence.take!(32)
[0,1,2,5,12,29,70,169,408,985,2378,5741,13860,33461,80782,195025,470832,1136689,2744210,6625109,15994428,38613965,93222358,225058681,543339720,1311738121,3166815962,7645370045,18457556052,44560482149,107578520350,259717522849]

create_sequence_a000142(opts)

OEIS Sequence A000142 - Factorial numbers: n! = 1234...*n

From OEIS A000142:

Factorial numbers: n! = 1234...*n (order of symmetric group S_n, number of permutations of n letters). (Formerly M1675 N0659)

Sequence IDs: :a000142

Finite: False

Offset: 0

Example

iex> Sequence.create(Elixir.Chunky.Sequence.OEIS.Core, :a000142) |> Sequence.take!(23)
[1,1,2,6,24,120,720,5040,40320,362880,3628800,39916800,479001600,6227020800,87178291200,1307674368000,20922789888000,355687428096000,6402373705728000,121645100408832000,2432902008176640000,51090942171709440000,1124000727777607680000]

create_sequence_a000166(opts)

OEIS Sequence A000166 - Subfactorial or rencontres numbers, or derangements: number of permutations of n elements with no fixed points.

From OEIS A000166:

Subfactorial or rencontres numbers, or derangements: number of permutations of n elements with no fixed points. (Formerly M1937 N0766)

Sequence IDs: :a000166

Finite: False

Offset: 0

Example

iex> Sequence.create(Elixir.Chunky.Sequence.OEIS.Core, :a000166) |> Sequence.take!(24)
[1,0,1,2,9,44,265,1854,14833,133496,1334961,14684570,176214841,2290792932,32071101049,481066515734,7697064251745,130850092279664,2355301661033953,44750731559645106,895014631192902121,18795307255050944540,413496759611120779881,9510425471055777937262]

create_sequence_a000169(opts)

OEIS Sequence A000169 - Number of labeled rooted trees with n nodes: n^(n-1).

From OEIS A000169:

Number of labeled rooted trees with n nodes: n^(n-1). (Formerly M1946 N0771)

Sequence IDs: :a000169

Finite: False

Offset: 1

Example

iex> Sequence.create(Elixir.Chunky.Sequence.OEIS.Core, :a000169) |> Sequence.take!(20)
[1,2,9,64,625,7776,117649,2097152,43046721,1000000000,25937424601,743008370688,23298085122481,793714773254144,29192926025390625,1152921504606846976,48661191875666868481,2185911559738696531968,104127350297911241532841,5242880000000000000000000]

create_sequence_a000203(opts)

OEIS Sequence A000203 - Sum of Divisors σ1(n)

From OEIS A000203:

(n) = sigma(n), the sum of the divisors of n. Also called sigma_1(n). (Formerly M2329 N0921)

Sequence IDs: :a000203

Finite: False

Offset: 1

Example

iex> Sequence.create(Sequence.OEIS.Core, :a000203) |> Sequence.take!(20)
[1, 3, 4, 7, 6, 12, 8, 15, 13, 18, 12, 28, 14, 24, 24, 31, 18, 39, 20, 42]

create_sequence_a000204(opts)

OEIS Sequence A000204 - Lucas numbers (beginning with 1)

From OEIS A000204:

Lucas numbers (beginning with 1): L(n) = L(n-1) + L(n-2) with L(1) = 1, L(2) = 3. (Formerly M2341 N0924)

Sequence IDs: :a000204

Finite: False

Offset: 1

Example

iex> Sequence.create(Elixir.Chunky.Sequence.OEIS.Core, :a000204) |> Sequence.take!(39)
[1,3,4,7,11,18,29,47,76,123,199,322,521,843,1364,2207,3571,5778,9349,15127,24476,39603,64079,103682,167761,271443,439204,710647,1149851,1860498,3010349,4870847,7881196,12752043,20633239,33385282,54018521,87403803,141422324]

create_sequence_a000217(opts)

OEIS Sequence A000217 - Triangular numbers: a(n) = binomial(n+1,2)

From OEIS A000217:

Triangular numbers: a(n) = binomial(n+1,2) = n(n+1)/2 = 0 + 1 + 2 + ... + n. (Formerly M2535 N1002)

Sequence IDs: :a000217

Finite: False

Offset: 0

Example

iex> Sequence.create(Elixir.Chunky.Sequence.OEIS.Core, :a000217) |> Sequence.take!(54)
[0,1,3,6,10,15,21,28,36,45,55,66,78,91,105,120,136,153,171,190,210,231,253,276,300,325,351,378,406,435,465,496,528,561,595,630,666,703,741,780,820,861,903,946,990,1035,1081,1128,1176,1225,1275,1326,1378,1431]

create_sequence_a000219(opts)

OEIS Sequence A000219 - Number of planar partitions (or plane partitions) of n.

From OEIS A000219:

Number of planar partitions (or plane partitions) of n. (Formerly M2566 N1016)

Sequence IDs: :a000219

Finite: False

Offset: 0

Example

iex> Sequence.create(Elixir.Chunky.Sequence.OEIS.Core, :a000219) |> Sequence.take!(41)
[1,1,3,6,13,24,48,86,160,282,500,859,1479,2485,4167,6879,11297,18334,29601,47330,75278,118794,186475,290783,451194,696033,1068745,1632658,2483234,3759612,5668963,8512309,12733429,18974973,28175955,41691046,61484961,90379784,132441995,193487501,281846923]

create_sequence_a000225(opts)

OEIS Sequence A000225 - a(n) = 2^n - 1. (Sometimes called Mersenne numbers, although that name is usually reserved for A001348.)

From OEIS A000225:

a(n) = 2^n - 1. (Sometimes called Mersenne numbers, although that name is usually reserved for A001348.) (Formerly M2655 N1059)

Sequence IDs: :a000225

Finite: False

Offset: 0

Example

iex> Sequence.create(Elixir.Chunky.Sequence.OEIS.Core, :a000225) |> Sequence.take!(33)
[0,1,3,7,15,31,63,127,255,511,1023,2047,4095,8191,16383,32767,65535,131071,262143,524287,1048575,2097151,4194303,8388607,16777215,33554431,67108863,134217727,268435455,536870911,1073741823,2147483647,4294967295]

create_sequence_a000244(opts)

OEIS Sequence A000244 - Powers of 3.

From OEIS A000244:

Powers of 3. (Formerly M2807 N1129)

Sequence IDs: :a000244

Finite: False

Offset: 0

Example

iex> Sequence.create(Elixir.Chunky.Sequence.OEIS.Core, :a000244) |> Sequence.take!(28)
[1,3,9,27,81,243,729,2187,6561,19683,59049,177147,531441,1594323,4782969,14348907,43046721,129140163,387420489,1162261467,3486784401,10460353203,31381059609,94143178827,282429536481,847288609443,2541865828329,7625597484987]

create_sequence_a000262(opts)

OEIS Sequence A000262 - Number of "sets of lists"

From OEIS A000262:

Number of "sets of lists": number of partitions of {1,...,n} into any number of lists, where a list means an ordered subset. (Formerly M2950 N1190)

Sequence IDs: :a000262

Finite: False

Offset: 0

Example

iex> Sequence.create(Elixir.Chunky.Sequence.OEIS.Core, :a000262) |> Sequence.take!(22)
[1,1,3,13,73,501,4051,37633,394353,4596553,58941091,824073141,12470162233,202976401213,3535017524403,65573803186921,1290434218669921,26846616451246353,588633468315403843,13564373693588558173,327697927886085654441,8281153039765859726341]

create_sequence_a000272(opts)

OEIS Sequence A000272 - Number of trees on n labeled nodes: n^(n-2) with a(0)=1.

From OEIS A000272:

Number of trees on n labeled nodes: n^(n-2) with a(0)=1. (Formerly M3027 N1227)

Sequence IDs: :a000272

Finite: False

Offset: 0

Example

iex> Sequence.create(Elixir.Chunky.Sequence.OEIS.Core, :a000272) |> Sequence.take!(20)
[1,1,1,3,16,125,1296,16807,262144,4782969,100000000,2357947691,61917364224,1792160394037,56693912375296,1946195068359375,72057594037927936,2862423051509815793,121439531096594251776,5480386857784802185939]

create_sequence_a000290(opts)

OEIS Sequence A000290 - The squares: a(n) = n^2.

From OEIS A000290:

The squares: a(n) = n^2. (Formerly M3356 N1350)

Sequence IDs: :a000290

Finite: False

Offset: 0

Example

iex> Sequence.create(Elixir.Chunky.Sequence.OEIS.Core, :a000290) |> Sequence.take!(51)
[0,1,4,9,16,25,36,49,64,81,100,121,144,169,196,225,256,289,324,361,400,441,484,529,576,625,676,729,784,841,900,961,1024,1089,1156,1225,1296,1369,1444,1521,1600,1681,1764,1849,1936,2025,2116,2209,2304,2401,2500]

create_sequence_a000292(opts)

OEIS Sequence A000292 - Tetrahedral (or triangular pyramidal) numbers: a(n) = C(n+2,3) = n(n+1)(n+2)/6.

From OEIS A000292:

Tetrahedral (or triangular pyramidal) numbers: a(n) = C(n+2,3) = n(n+1)(n+2)/6. (Formerly M3382 N1363)

Sequence IDs: :a000292

Finite: False

Offset: 0

Example

iex> Sequence.create(Elixir.Chunky.Sequence.OEIS.Core, :a000292) |> Sequence.take!(45)
[0,1,4,10,20,35,56,84,120,165,220,286,364,455,560,680,816,969,1140,1330,1540,1771,2024,2300,2600,2925,3276,3654,4060,4495,4960,5456,5984,6545,7140,7770,8436,9139,9880,10660,11480,12341,13244,14190,15180]

create_sequence_a000302(opts)

OEIS Sequence A000302 - Powers of 4: a(n) = 4^n.

From OEIS A000302:

Powers of 4: a(n) = 4^n. (Formerly M3518 N1428)

Sequence IDs: :a000302

Finite: False

Offset: 0

Example

iex> Sequence.create(Elixir.Chunky.Sequence.OEIS.Core, :a000302) |> Sequence.take!(25)
[1,4,16,64,256,1024,4096,16384,65536,262144,1048576,4194304,16777216,67108864,268435456,1073741824,4294967296,17179869184,68719476736,274877906944,1099511627776,4398046511104,17592186044416,70368744177664,281474976710656]

create_sequence_a000312(opts)

OEIS Sequence A000312 - a(n) = n^n; number of labeled mappings from n points to themselves (endofunctions).

From OEIS A000312:

a(n) = n^n; number of labeled mappings from n points to themselves (endofunctions). (Formerly M3619 N1469)

Sequence IDs: :a000312

Finite: False

Offset: 0

Example

iex> Sequence.create(Elixir.Chunky.Sequence.OEIS.Core, :a000312) |> Sequence.take!(18)
[1,1,4,27,256,3125,46656,823543,16777216,387420489,10000000000,285311670611,8916100448256,302875106592253,11112006825558016,437893890380859375,18446744073709551616,827240261886336764177]

create_sequence_a000326(opts)

OEIS Sequence A000326 - Pentagonal numbers: a(n) = n(3n-1)/2.

From OEIS A000326:

Pentagonal numbers: a(n) = n(3n-1)/2. (Formerly M3818 N1562)

Sequence IDs: :a000326

Finite: False

Offset: 0

Example

iex> Sequence.create(Elixir.Chunky.Sequence.OEIS.Core, :a000326) |> Sequence.take!(47)
[0,1,5,12,22,35,51,70,92,117,145,176,210,247,287,330,376,425,477,532,590,651,715,782,852,925,1001,1080,1162,1247,1335,1426,1520,1617,1717,1820,1926,2035,2147,2262,2380,2501,2625,2752,2882,3015,3151]

create_sequence_a000330(opts)

OEIS Sequence A000330 - Square pyramidal numbers: a(n) = 0^2 + 1^2 + 2^2 + ... + n^2 = n(n+1)(2*n+1)/6.

From OEIS A000330:

Square pyramidal numbers: a(n) = 0^2 + 1^2 + 2^2 + ... + n^2 = n(n+1)(2*n+1)/6. (Formerly M3844 N1574)

Sequence IDs: :a000330

Finite: False

Offset: 0

Example

iex> Sequence.create(Elixir.Chunky.Sequence.OEIS.Core, :a000330) |> Sequence.take!(45)
[0,1,5,14,30,55,91,140,204,285,385,506,650,819,1015,1240,1496,1785,2109,2470,2870,3311,3795,4324,4900,5525,6201,6930,7714,8555,9455,10416,11440,12529,13685,14910,16206,17575,19019,20540,22140,23821,25585,27434,29370]

create_sequence_a000364(opts)

OEIS Sequence A000364 - Euler (or secant or "Zig") numbers: e.g.f. (even powers only) sec(x) = 1/cos(x).

From OEIS A000364:

Euler (or secant or "Zig") numbers: e.g.f. (even powers only) sec(x) = 1/cos(x). (Formerly M4019 N1667)

Sequence IDs: :a000364

Finite: False

Offset: 0

Example

iex> Sequence.create(Elixir.Chunky.Sequence.OEIS.Core, :a000364) |> Sequence.take!(17)
[1,1,5,61,1385,50521,2702765,199360981,19391512145,2404879675441,370371188237525,69348874393137901,15514534163557086905,4087072509293123892361,1252259641403629865468285,441543893249023104553682821,177519391579539289436664789665]

create_sequence_a000396(opts)

OEIS Sequence A000396 - Perfect Numbers

From OEIS A000396:

Perfect numbers n: n is equal to the sum of the proper divisors of n. (Formerly M4186 N1744)

Sequence IDs: :a000396

Finite: True

Offset: 1

Example

iex> Sequence.create(Sequence.OEIS.Core, :a000396) |> Sequence.take!(5)
[6, 28, 496, 8128, 33550336]

create_sequence_a000521(opts)

OEIS Sequence A000521 - Coefficients of modular function j as power series in q = e^(2 Pi i t)

From OEIS A000521:

Coefficients of modular function j as power series in q = e^(2 Pi i t). Another name is the elliptic modular invariant J(tau). (Formerly M5477 N2372)

Sequence IDs: :a000521

Finite: False

Offset: -1

Example

iex> Sequence.create(Elixir.Chunky.Sequence.OEIS.Core, :a000521) |> Sequence.take!(17)
[1,744,196884,21493760,864299970,20245856256,333202640600,4252023300096,44656994071935,401490886656000,3176440229784420,22567393309593600,146211911499519294,874313719685775360,4872010111798142520,25497827389410525184,126142916465781843075]

create_sequence_a000578(opts)

OEIS Sequence A000578 - The cubes: a(n) = n^3.

From OEIS A000578:

The cubes: a(n) = n^3. (Formerly M4499 N1905)

Sequence IDs: :a000578

Finite: False

Offset: 0

Example

iex> Sequence.create(Elixir.Chunky.Sequence.OEIS.Core, :a000578) |> Sequence.take!(41)
[0,1,8,27,64,125,216,343,512,729,1000,1331,1728,2197,2744,3375,4096,4913,5832,6859,8000,9261,10648,12167,13824,15625,17576,19683,21952,24389,27000,29791,32768,35937,39304,42875,46656,50653,54872,59319,64000]

create_sequence_a000583(opts)

OEIS Sequence A000583 - Fourth powers: a(n) = n^4

From OEIS A000583:

Fourth powers: a(n) = n^4. (Formerly M5004 N2154)

Sequence IDs: :a000583

Finite: False

Offset: 0

Example

iex> Sequence.create(Elixir.Chunky.Sequence.OEIS.Core, :a000583) |> Sequence.take!(34)
[0,1,16,81,256,625,1296,2401,4096,6561,10000,14641,20736,28561,38416,50625,65536,83521,104976,130321,160000,194481,234256,279841,331776,390625,456976,531441,614656,707281,810000,923521,1048576,1185921]

create_sequence_a000593(opts)

OEIS Sequence A000593 - Sum of Odd Divisors of N

From OEIS A000593:

Sum of odd divisors of n. (Formerly M3197 N1292)

Sequence IDs: :a000593

Finite: False

Offset: 1

Example

iex> Sequence.create(Sequence.OEIS.Core, :a000593) |> Sequence.take!(10)
[1, 1, 4, 1, 6, 4, 8, 1, 13, 6]

create_sequence_a000594(opts)

OEIS Sequence A000594 - Ramanujan's tau function

From OEIS A000594:

Ramanujan's tau function (or Ramanujan numbers, or tau numbers). (Formerly M5153 N2237)

Sequence IDs: :a000594

Finite: False

Offset: 1

Example

iex> Sequence.create(Elixir.Chunky.Sequence.OEIS.Core, :a000594) |> Sequence.take!(28)
[1,-24,252,-1472,4830,-6048,-16744,84480,-113643,-115920,534612,-370944,-577738,401856,1217160,987136,-6905934,2727432,10661420,-7109760,-4219488,-12830688,18643272,21288960,-25499225,13865712,-73279080,24647168]

create_sequence_a000609(opts)

OEIS Sequence A000609 - Number of threshold functions of n or fewer variables.

From OEIS A000609:

Number of threshold functions of n or fewer variables. (Formerly M1285 N0492)

Sequence IDs: :a000609

Finite: False

Offset: 0

Example

iex> Sequence.create(Elixir.Chunky.Sequence.OEIS.Core, :a000609) |> Sequence.take!(10)
[2,4,14,104,1882,94572,15028134,8378070864,17561539552946,144130531453121108]

create_sequence_a000670(opts)

OEIS Sequence A000670 - Fubini numbers: number of preferential arrangements of n labeled elements; or number of weak orders on n labeled elements; or number of ordered partitions of [n].

From OEIS A000670:

Fubini numbers: number of preferential arrangements of n labeled elements; or number of weak orders on n labeled elements; or number of ordered partitions of [n]. (Formerly M2952 N1191)

Sequence IDs: :a000670

Finite: False

Offset: 0

Example

iex> Sequence.create(Elixir.Chunky.Sequence.OEIS.Core, :a000670) |> Sequence.take!(21)
[1,1,3,13,75,541,4683,47293,545835,7087261,102247563,1622632573,28091567595,526858348381,10641342970443,230283190977853,5315654681981355,130370767029135901,3385534663256845323,92801587319328411133,2677687796244384203115]

create_sequence_a000688(opts)

OEIS Sequence A000688 - Number of Abelian groups of order n

From OEIS A000688:

Number of Abelian groups of order n; number of factorizations of n into prime powers. (Formerly M0064 N0020)

Sequence IDs: :a000688

Finite: False

Offset: 1

Example

iex> Sequence.create(Elixir.Chunky.Sequence.OEIS.Core, :a000688) |> Sequence.take!(107)
[1,1,1,2,1,1,1,3,2,1,1,2,1,1,1,5,1,2,1,2,1,1,1,3,2,1,3,2,1,1,1,7,1,1,1,4,1,1,1,3,1,1,1,2,2,1,1,5,2,2,1,2,1,3,1,3,1,1,1,2,1,1,2,11,1,1,1,2,1,1,1,6,1,1,2,2,1,1,1,5,5,1,1,2,1,1,1,3,1,2,1,2,1,1,1,7,1,2,2,4,1,1,1,3,1,1,1]

create_sequence_a000720(opts)

OEIS Sequence A000720 - pi(n), the number of primes <= n

From OEIS A000720:

pi(n), the number of primes <= n. Sometimes called PrimePi(n) to distinguish it from the number 3.14159... (Formerly M0256 N0090)

Sequence IDs: :a000720

Finite: False

Offset: 1

Example

iex> Sequence.create(Elixir.Chunky.Sequence.OEIS.Core, :a000720) |> Sequence.take!(78)
[0,1,2,2,3,3,4,4,4,4,5,5,6,6,6,6,7,7,8,8,8,8,9,9,9,9,9,9,10,10,11,11,11,11,11,11,12,12,12,12,13,13,14,14,14,14,15,15,15,15,15,15,16,16,16,16,16,16,17,17,18,18,18,18,18,18,19,19,19,19,20,20,21,21,21,21,21,21]

create_sequence_a000796(opts)

OEIS Sequence A000796 - Decimal expansion of Pi (or digits of Pi).

From OEIS A000796:

Decimal expansion of Pi (or digits of Pi). (Formerly M2218 N0880)

Sequence IDs: :a000796

Finite: False

Offset: 1

Example

iex> Sequence.create(Elixir.Chunky.Sequence.OEIS.Core, :a000796) |> Sequence.take!(105)
[3,1,4,1,5,9,2,6,5,3,5,8,9,7,9,3,2,3,8,4,6,2,6,4,3,3,8,3,2,7,9,5,0,2,8,8,4,1,9,7,1,6,9,3,9,9,3,7,5,1,0,5,8,2,0,9,7,4,9,4,4,5,9,2,3,0,7,8,1,6,4,0,6,2,8,6,2,0,8,9,9,8,6,2,8,0,3,4,8,2,5,3,4,2,1,1,7,0,6,7,9,8,2,1,4]

create_sequence_a000798(opts)

OEIS Sequence A000798 - Number of different quasi-orders (or topologies, or transitive digraphs) with n labeled elements.

From OEIS A000798:

Number of different quasi-orders (or topologies, or transitive digraphs) with n labeled elements. (Formerly M3631 N1476)

Sequence IDs: :a000798

Finite: False

Offset: 0

Example

iex> Sequence.create(Elixir.Chunky.Sequence.OEIS.Core, :a000798) |> Sequence.take!(19)
[1,1,4,29,355,6942,209527,9535241,642779354,63260289423,8977053873043,1816846038736192,519355571065774021,207881393656668953041,115617051977054267807460,88736269118586244492485121,93411113411710039565210494095,134137950093337880672321868725846,261492535743634374805066126901117203]

create_sequence_a000959(opts)

OEIS Sequence A000959 - Lucky numbers.

From OEIS A000959:

Lucky numbers. (Formerly M2616 N1035)

Sequence IDs: :a000959

Finite: False

Offset: 1

Example

iex> Sequence.create(Elixir.Chunky.Sequence.OEIS.Core, :a000959) |> Sequence.take!(57)
[1,3,7,9,13,15,21,25,31,33,37,43,49,51,63,67,69,73,75,79,87,93,99,105,111,115,127,129,133,135,141,151,159,163,169,171,189,193,195,201,205,211,219,223,231,235,237,241,259,261,267,273,283,285,289,297,303]

create_sequence_a000961(opts)

OEIS Sequence A000961 - Powers of primes. Alternatively, 1 and the prime powers (p^k, p prime, k >= 1).

From OEIS A000961:

Powers of primes. Alternatively, 1 and the prime powers (p^k, p prime, k >= 1). (Formerly M0517 N0185)

Sequence IDs: :a000961

Finite: False

Offset: 1

Example

iex> Sequence.create(Elixir.Chunky.Sequence.OEIS.Core, :a000961) |> Sequence.take!(64)
[1,2,3,4,5,7,8,9,11,13,16,17,19,23,25,27,29,31,32,37,41,43,47,49,53,59,61,64,67,71,73,79,81,83,89,97,101,103,107,109,113,121,125,127,128,131,137,139,149,151,157,163,167,169,173,179,181,191,193,197,199,211,223,227]

create_sequence_a000984(opts)

OEIS Sequence A000984 - Central binomial coefficients: binomial(2n,n) = (2n)!/(n!)^2.

From OEIS A000984:

Central binomial coefficients: binomial(2n,n) = (2n)!/(n!)^2. (Formerly M1645 N0643)

Sequence IDs: :a000984

Finite: False

Offset: 0

Example

iex> Sequence.create(Elixir.Chunky.Sequence.OEIS.Core, :a000984) |> Sequence.take!(28)
[1,2,6,20,70,252,924,3432,12870,48620,184756,705432,2704156,10400600,40116600,155117520,601080390,2333606220,9075135300,35345263800,137846528820,538257874440,2104098963720,8233430727600,32247603683100,126410606437752,495918532948104,1946939425648112]

create_sequence_a001003(opts)

OEIS Sequence A001003 - Schroeder's second problem (generalized parentheses); also called super-Catalan numbers or little Schroeder numbers.

From OEIS A001003:

Schroeder's second problem (generalized parentheses); also called super-Catalan numbers or little Schroeder numbers. (Formerly M2898 N1163)

Sequence IDs: :a001003

Finite: False

Offset: 0

Example

iex> Sequence.create(Elixir.Chunky.Sequence.OEIS.Core, :a001003) |> Sequence.take!(24)
[1,1,3,11,45,197,903,4279,20793,103049,518859,2646723,13648869,71039373,372693519,1968801519,10463578353,55909013009,300159426963,1618362158587,8759309660445,47574827600981,259215937709463,1416461675464871]

create_sequence_a001006(opts)

OEIS Sequence A001006 - Motzkin numbers

From OEIS A001006:

Motzkin numbers: number of ways of drawing any number of nonintersecting chords joining n (labeled) points on a circle. (Formerly M1184 N0456)

Sequence IDs: :a001006

Finite: False

Offset: 0

Example

iex> Sequence.create(Elixir.Chunky.Sequence.OEIS.Core, :a001006) |> Sequence.take!(30)
[1,1,2,4,9,21,51,127,323,835,2188,5798,15511,41835,113634,310572,853467,2356779,6536382,18199284,50852019,142547559,400763223,1129760415,3192727797,9043402501,25669818476,73007772802,208023278209,593742784829]

create_sequence_a001045(opts)

OEIS Sequence A001045 - Jacobsthal sequence (or Jacobsthal numbers)

From OEIS A001045:

Jacobsthal sequence (or Jacobsthal numbers): a(n) = a(n-1) + 2*a(n-2), with a(0) = 0, a(1) = 1. (Formerly M2482 N0983)

Sequence IDs: :a001045

Finite: False

Offset: 0

Example

iex> Sequence.create(Elixir.Chunky.Sequence.OEIS.Core, :a001045) |> Sequence.take!(35)
[0,1,1,3,5,11,21,43,85,171,341,683,1365,2731,5461,10923,21845,43691,87381,174763,349525,699051,1398101,2796203,5592405,11184811,22369621,44739243,89478485,178956971,357913941,715827883,1431655765,2863311531,5726623061]

create_sequence_a001055(opts)

OEIS Sequence A001055 - The multiplicative partition function: number of ways of factoring n with all factors greater than 1 (a(1) = 1 by convention).

From OEIS A001055:

The multiplicative partition function: number of ways of factoring n with all factors greater than 1 (a(1) = 1 by convention). (Formerly M0095 N0032)

Sequence IDs: :a001055

Finite: False

Offset: 1

Example

iex> Sequence.create(Elixir.Chunky.Sequence.OEIS.Core, :a001055) |> Sequence.take!(103)
[1,1,1,2,1,2,1,3,2,2,1,4,1,2,2,5,1,4,1,4,2,2,1,7,2,2,3,4,1,5,1,7,2,2,2,9,1,2,2,7,1,5,1,4,4,2,1,12,2,4,2,4,1,7,2,7,2,2,1,11,1,2,4,11,2,5,1,4,2,5,1,16,1,2,4,4,2,5,1,12,5,2,1,11,2,2,2,7,1,11,2,4,2,2,2,19,1,4,4,9,1,5,1]

create_sequence_a001065(opts)

OEIS Sequence A001065 - Sum of proper divisors (Aliquot parts) of N.

From OEIS A001065:

Sum of proper divisors (or aliquot parts) of n: sum of divisors of n that are less than n. (Formerly M2226 N0884)

Sequence IDs: :a001065

Finite: False

Offset: 1

Example

iex> Sequence.create(Sequence.OEIS.Core, :a001065) |> Sequence.take!(20)
[0, 1, 1, 3, 1, 6, 1, 7, 4, 8, 1, 16, 1, 10, 9, 15, 1, 21, 1, 22]

create_sequence_a001157(opts)

OEIS Sequence A001157 - Sum of squares of divisors of N, simga-2(n), 𝝈2(n).

From OEIS A001157:

sigma_2(n): sum of squares of divisors of n. (Formerly M3799 N1551)

Sequence IDs: :a001157

Finite: False

Offset: 1

Example

iex> Sequence.create(Sequence.OEIS.Core, :a001157) |> Sequence.take!(10)
[1, 5, 10, 21, 26, 50, 50, 85, 91, 130]

create_sequence_a001190(opts)

OEIS Sequence A001190 - Wedderburn-Etherington numbers: unlabeled binary rooted trees (every node has out-degree 0 or 2) with n endpoints (and 2n-1 nodes in all).

From OEIS A001190:

Wedderburn-Etherington numbers: unlabeled binary rooted trees (every node has out-degree 0 or 2) with n endpoints (and 2n-1 nodes in all). (Formerly M0790 N0298)

Sequence IDs: :a001190

Finite: False

Offset: 0

Example

iex> Sequence.create(Elixir.Chunky.Sequence.OEIS.Core, :a001190) |> Sequence.take!(35)
[0,1,1,1,2,3,6,11,23,46,98,207,451,983,2179,4850,10905,24631,56011,127912,293547,676157,1563372,3626149,8436379,19680277,46026618,107890609,253450711,596572387,1406818759,3323236238,7862958391,18632325319,44214569100]

create_sequence_a001221(opts)

OEIS Sequence A001221 - Number of distinct primes dividing n (also called omega(n)).

From OEIS A001221:

Number of distinct primes dividing n (also called omega(n)). (Formerly M0056 N0019)

Sequence IDs: :a001221

Finite: False

Offset: 1

Example

iex> Sequence.create(Elixir.Chunky.Sequence.OEIS.Core, :a001221) |> Sequence.take!(111)
[0,1,1,1,1,2,1,1,1,2,1,2,1,2,2,1,1,2,1,2,2,2,1,2,1,2,1,2,1,3,1,1,2,2,2,2,1,2,2,2,1,3,1,2,2,2,1,2,1,2,2,2,1,2,2,2,2,2,1,3,1,2,2,1,2,3,1,2,2,3,1,2,1,2,2,2,2,3,1,2,1,2,1,3,2,2,2,2,1,3,2,2,2,2,2,2,1,2,2,2,1,3,1,2,3,2,1,2,1,3,2]

create_sequence_a001222(opts)

OEIS Sequence A001222 - Number of prime divisors of n counted with multiplicity (also called bigomega(n) or Omega(n)).

From OEIS A001222:

Number of prime divisors of n counted with multiplicity (also called bigomega(n) or Omega(n)). (Formerly M0094 N0031)

Sequence IDs: :a001222

Finite: False

Offset: 1

Example

iex> Sequence.create(Elixir.Chunky.Sequence.OEIS.Core, :a001222) |> Sequence.take!(111)
[0,1,1,2,1,2,1,3,2,2,1,3,1,2,2,4,1,3,1,3,2,2,1,4,2,2,3,3,1,3,1,5,2,2,2,4,1,2,2,4,1,3,1,3,3,2,1,5,2,3,2,3,1,4,2,4,2,2,1,4,1,2,3,6,2,3,1,3,2,3,1,5,1,2,3,3,2,3,1,5,4,2,1,4,2,2,2,4,1,4,2,3,2,2,2,6,1,3,3,4,1,3,1,4,3,2,1,5,1,3,2]

create_sequence_a001227(opts)

OEIS Sequence A001227 - Number of odd divisors of n.

From OEIS A001227:

Number of odd divisors of n. (Formerly )

Sequence IDs: :a001227

Finite: False

Offset: 1

Example

iex> Sequence.create(Elixir.Chunky.Sequence.OEIS.Core, :a001227) |> Sequence.take!(105)
[1,1,2,1,2,2,2,1,3,2,2,2,2,2,4,1,2,3,2,2,4,2,2,2,3,2,4,2,2,4,2,1,4,2,4,3,2,2,4,2,2,4,2,2,6,2,2,2,3,3,4,2,2,4,4,2,4,2,2,4,2,2,6,1,4,4,2,2,4,4,2,3,2,2,6,2,4,4,2,2,5,2,2,4,4,2,4,2,2,6,4,2,4,2,4,2,2,3,6,3,2,4,2,2,8]

create_sequence_a001358(opts)

OEIS Sequence A001358 - Semiprimes (or biprimes): products of two primes.

From OEIS A001358:

Semiprimes (or biprimes): products of two primes. (Formerly M3274 N1323)

Sequence IDs: :a001358

Finite: False

Offset: 1

Example

iex> Sequence.create(Elixir.Chunky.Sequence.OEIS.Core, :a001358) |> Sequence.take!(61)
[4,6,9,10,14,15,21,22,25,26,33,34,35,38,39,46,49,51,55,57,58,62,65,69,74,77,82,85,86,87,91,93,94,95,106,111,115,118,119,121,122,123,129,133,134,141,142,143,145,146,155,158,159,161,166,169,177,178,183,185,187]

create_sequence_a001477(opts)

OEIS Sequence A001477 - The nonnegative integers.

From OEIS A001477:

The nonnegative integers. (Formerly )

Sequence IDs: :a001477

Finite: False

Offset: 0

Example

iex> Sequence.create(Elixir.Chunky.Sequence.OEIS.Core, :a001477) |> Sequence.take!(78)
[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77]

create_sequence_a001489(opts)

OEIS Sequence A001489 - a(n) = -n.

From OEIS A001489:

a(n) = -n. (Formerly )

Sequence IDs: :a001489

Finite: False

Offset: 0

Example

iex> Sequence.create(Elixir.Chunky.Sequence.OEIS.Core, :a001489) |> Sequence.take!(66)
[0,-1,-2,-3,-4,-5,-6,-7,-8,-9,-10,-11,-12,-13,-14,-15,-16,-17,-18,-19,-20,-21,-22,-23,-24,-25,-26,-27,-28,-29,-30,-31,-32,-33,-34,-35,-36,-37,-38,-39,-40,-41,-42,-43,-44,-45,-46,-47,-48,-49,-50,-51,-52,-53,-54,-55,-56,-57,-58,-59,-60,-61,-62,-63,-64,-65]

create_sequence_a001511(opts)

OEIS Sequence A001511 - The ruler function: 2^a(n) divides 2n

From OEIS A001511:

The ruler function: 2^a(n) divides 2n. Or, a(n) = 2-adic valuation of 2n. (Formerly M0127 N0051)

Sequence IDs: :a001511

Finite: False

Offset: 1

Example

iex> Sequence.create(Elixir.Chunky.Sequence.OEIS.Core, :a001511) |> Sequence.take!(105)
[1,2,1,3,1,2,1,4,1,2,1,3,1,2,1,5,1,2,1,3,1,2,1,4,1,2,1,3,1,2,1,6,1,2,1,3,1,2,1,4,1,2,1,3,1,2,1,5,1,2,1,3,1,2,1,4,1,2,1,3,1,2,1,7,1,2,1,3,1,2,1,4,1,2,1,3,1,2,1,5,1,2,1,3,1,2,1,4,1,2,1,3,1,2,1,6,1,2,1,3,1,2,1,4,1]

create_sequence_a001615(opts)

OEIS Sequence A001615 - Dedekind psi function: n * Product_{p|n, p prime} (1 + 1/p).

From OEIS A001615:

Dedekind psi function: n * Product_{p|n, p prime} (1 + 1/p). (Formerly M2315 N0915)

Sequence IDs: :a001615

Finite: False

Offset: 1

Example

iex> Sequence.create(Sequence.OEIS.Core, :a001615) |> Sequence.take!(69)
[1,3,4,6,6,12,8,12,12,18,12,24,14,24,24,24,18,36,20,36,32,36,24,48,30,42,36,48,30,72,32,48,48,54,48,72,38,60,56,72,42,96,44,72,72,72,48,96,56,90,72,84,54,108,72,96,80,90,60,144,62,96,96,96,84,144,68,108,96]

create_sequence_a002106(opts)

OEIS Sequence A002106 - Number of transitive permutation groups of degree n.

From OEIS A002106:

Number of transitive permutation groups of degree n. (Formerly M1316 N0504)

Sequence IDs: :a002106

Finite: False

Offset: 1

Example

iex> Sequence.create(Elixir.Chunky.Sequence.OEIS.Core, :a002106) |> Sequence.take!(47)
[1,1,2,5,5,16,7,50,34,45,8,301,9,63,104,1954,10,983,8,1117,164,59,7,25000,211,96,2392,1854,8,5712,12,2801324,162,115,407,121279,11,76,306,315842,10,9491,10,2113,10923,56,6]

create_sequence_a002654(opts)

OEIS Sequence A002654 - Number of ways of writing n as a sum of at most two nonzero squares, where order matters

From OEIS A002654:

Number of ways of writing n as a sum of at most two nonzero squares, where order matters; also (number of divisors of n of form 4m+1) - (number of divisors of form 4m+3). (Formerly M0012 N0001)

Sequence IDs: :a002654

Finite: False

Offset: 1

Example

iex> Sequence.create(Elixir.Chunky.Sequence.OEIS.Core, :a002654) |> Sequence.take!(105)
[1,1,0,1,2,0,0,1,1,2,0,0,2,0,0,1,2,1,0,2,0,0,0,0,3,2,0,0,2,0,0,1,0,2,0,1,2,0,0,2,2,0,0,0,2,0,0,0,1,3,0,2,2,0,0,0,0,2,0,0,2,0,0,1,4,0,0,2,0,0,0,1,2,2,0,0,0,0,0,2,1,2,0,0,4,0,0,0,2,2,0,0,0,0,0,0,2,1,0,3,2,0,0,2,0]

create_sequence_a002808(opts)

OEIS Sequence A002808 - The composite numbers: numbers n of the form x*y for x > 1 and y > 1.

From OEIS A002808:

The composite numbers: numbers n of the form x*y for x > 1 and y > 1. (Formerly M3272 N1322)

Sequence IDs: :a002808

Finite: False

Offset: 1

Example

iex> Sequence.create(Elixir.Chunky.Sequence.OEIS.Core, :a002808) |> Sequence.take!(64) 
[4,6,8,9,10,12,14,15,16,18,20,21,22,24,25,26,27,28,30,32,33,34,35,36,38,39,40,42,44,45,46,48,49,50,51,52,54,55,56,57,58,60,62,63,64,65,66,68,69,70,72,74,75,76,77,78,80,81,82,84,85,86,87,88]

create_sequence_a003094(opts)

OEIS Sequence A003094 - Number of unlabeled connected planar simple graphs with n nodes.

From OEIS A003094:

Number of unlabeled connected planar simple graphs with n nodes. (Formerly M1652)

Sequence IDs: :a003094

Finite: False

Offset: 0

Example

iex> Sequence.create(Elixir.Chunky.Sequence.OEIS.Core, :a003094) |> Sequence.take!(13)
[1,1,1,2,6,20,99,646,5974,71885,1052805,17449299,313372298]

create_sequence_a003484(opts)

OEIS Sequence A003484 - Radon function, also called Hurwitz-Radon numbers.

From OEIS A003484:

Radon function, also called Hurwitz-Radon numbers. (Formerly M0161)

Sequence IDs: :a003484

Finite: False

Offset: 1

Example

iex> Sequence.create(Elixir.Chunky.Sequence.OEIS.Core, :a003484) |> Sequence.take!(102)
[1,2,1,4,1,2,1,8,1,2,1,4,1,2,1,9,1,2,1,4,1,2,1,8,1,2,1,4,1,2,1,10,1,2,1,4,1,2,1,8,1,2,1,4,1,2,1,9,1,2,1,4,1,2,1,8,1,2,1,4,1,2,1,12,1,2,1,4,1,2,1,8,1,2,1,4,1,2,1,9,1,2,1,4,1,2,1,8,1,2,1,4,1,2,1,10,1,2,1,4,1,2]

create_sequence_a005100(opts)

OEIS Sequence A005100 - Deficient Numbers

From OEIS A005100:

Deficient numbers: numbers n such that sigma(n) < 2n. (Formerly M0514)

Sequence IDs: :a005100

Finite: False

Offset: 1

Example

iex> Sequence.create(Sequence.OEIS.Core, :a005100) |> Sequence.take!(25)
[1, 2, 3, 4, 5, 7, 8, 9, 10, 11, 13, 14, 15, 16, 17, 19, 21, 22, 23, 25, 26, 27, 29, 31, 32]

create_sequence_a005101(opts)

OEIS Sequence A005101 - Abundant Numbers

From OEIS A005101:

Abundant numbers (sum of divisors of n exceeds 2n). (Formerly M4825)

Sequence IDs: :a005101

Finite: False

Offset: 1

Example

iex> Sequence.create(Sequence.OEIS.Core, :a005101) |> Sequence.take!(10)
[12, 18, 20, 24, 30, 36, 40, 42, 48, 54]

create_sequence_a005117(opts)

OEIS Sequence A005117 - Squarefree numbers: numbers that are not divisible by a square greater than 1.

From OEIS A005117:

Squarefree numbers: numbers that are not divisible by a square greater than 1. (Formerly M0617)

Sequence IDs: :a005117

Finite: False

Offset: 1

Example

iex> Sequence.create(Elixir.Chunky.Sequence.OEIS.Core, :a005117) |> Sequence.take!(71)
[1,2,3,5,6,7,10,11,13,14,15,17,19,21,22,23,26,29,30,31,33,34,35,37,38,39,41,42,43,46,47,51,53,55,57,58,59,61,62,65,66,67,69,70,71,73,74,77,78,79,82,83,85,86,87,89,91,93,94,95,97,101,102,103,105,106,107,109,110,111,113]

create_sequence_a005470(opts)

OEIS Sequence A005470 - Number of unlabeled planar simple graphs with n nodes.

From OEIS A005470:

Number of unlabeled planar simple graphs with n nodes. (Formerly M1252)

Sequence IDs: :a005470

Finite: False

Offset: 0

Example

iex> Sequence.create(Elixir.Chunky.Sequence.OEIS.Core, :a005470) |> Sequence.take!(13)
[1,1,2,4,11,33,142,822,6966,79853,1140916,18681008,333312451]

create_sequence_a005843(opts)

OEIS Sequence A005843 - The nonnegative even numbers: a(n) = 2n.

From OEIS A005843:

The nonnegative even numbers: a(n) = 2n. (Formerly M0985)

Sequence IDs: :a005843

Finite: False

Offset: 0

Example

iex> Sequence.create(Elixir.Chunky.Sequence.OEIS.Core, :a005843) |> Sequence.take!(61)
[0,2,4,6,8,10,12,14,16,18,20,22,24,26,28,30,32,34,36,38,40,42,44,46,48,50,52,54,56,58,60,62,64,66,68,70,72,74,76,78,80,82,84,86,88,90,92,94,96,98,100,102,104,106,108,110,112,114,116,118,120]

create_sequence_a006530(opts)

OEIS Sequence A006530 - Gpf(n): greatest prime dividing n

From OEIS A006530:

Gpf(n): greatest prime dividing n, for n >= 2; a(1)=1. (Formerly M0428)

Sequence IDs: :a006530

Finite: False

Offset: 1

Example

iex> Sequence.create(Elixir.Chunky.Sequence.OEIS.Core, :a006530) |> Sequence.take!(86)
[1,2,3,2,5,3,7,2,3,5,11,3,13,7,5,2,17,3,19,5,7,11,23,3,5,13,3,7,29,5,31,2,11,17,7,3,37,19,13,5,41,7,43,11,5,23,47,3,7,5,17,13,53,3,11,7,19,29,59,5,61,31,7,2,13,11,67,17,23,7,71,3,73,37,5,19,11,13,79,5,3,41,83,7,17,43]

create_sequence_a006966(opts)

OEIS Sequence A006966 - Number of lattices on n unlabeled nodes.

From OEIS A006966:

Number of lattices on n unlabeled nodes. (Formerly M1486)

Sequence IDs: :a006966

Finite: False

Offset: 0

Example

iex> Sequence.create(Elixir.Chunky.Sequence.OEIS.Core, :a006966) |> Sequence.take!(21)
[1,1,1,1,2,5,15,53,222,1078,5994,37622,262776,2018305,16873364,152233518,1471613387,15150569446,165269824761,1901910625578,23003059864006]

create_sequence_a008292(opts)

OEIS Sequence A008292 - Triangle of Eulerian numbers T(n,k) (n >= 1, 1 <= k <= n) read by rows.

From OEIS A008292:

Triangle of Eulerian numbers T(n,k) (n >= 1, 1 <= k <= n) read by rows. (Formerly )

Sequence IDs: :a008292

Finite: False

Offset: 1

Example

iex> Sequence.create(Elixir.Chunky.Sequence.OEIS.Core, :a008292) |> Sequence.take!(55)
[1,1,1,1,4,1,1,11,11,1,1,26,66,26,1,1,57,302,302,57,1,1,120,1191,2416,1191,120,1,1,247,4293,15619,15619,4293,247,1,1,502,14608,88234,156190,88234,14608,502,1,1,1013,47840,455192,1310354,1310354,455192,47840,1013,1]

create_sequence_a008683(opts)

OEIS Sequence A008683 - Möbius (or Moebius) function mu(n)

From OEIS A008683:

Möbius (or Moebius) function mu(n). mu(1) = 1; mu(n) = (-1)^k if n is the product of k different primes; otherwise mu(n) = 0.

Sequence IDs: :a008683

Finite: False

Offset: 1

Example

iex> Sequence.create(Elixir.Chunky.Sequence.OEIS.Core, :a008683) |> Sequence.take!(78)
[1,-1,-1,0,-1,1,-1,0,0,1,-1,0,-1,1,1,0,-1,0,-1,0,1,1,-1,0,0,1,0,0,-1,-1,-1,0,1,1,1,0,-1,1,1,0,-1,-1,-1,0,0,1,-1,0,0,0,1,0,-1,0,1,0,1,1,-1,0,-1,1,0,0,1,-1,-1,0,1,-1,-1,0,-1,1,0,0,1,-1]

create_sequence_a020639(opts)

OEIS Sequence A020639 - Lpf(n): least prime dividing

From OEIS A020639:

Lpf(n): least prime dividing n (when n > 1); a(1) = 1.

Sequence IDs: :a020639

Finite: False

Offset: 1

Example

iex> Sequence.create(Elixir.Chunky.Sequence.OEIS.Core, :a020639) |> Sequence.take!(97)
[1,2,3,2,5,2,7,2,3,2,11,2,13,2,3,2,17,2,19,2,3,2,23,2,5,2,3,2,29,2,31,2,3,2,5,2,37,2,3,2,41,2,43,2,3,2,47,2,7,2,3,2,53,2,5,2,3,2,59,2,61,2,3,2,5,2,67,2,3,2,71,2,73,2,3,2,7,2,79,2,3,2,83,2,5,2,3,2,89,2,7,2,3,2,5,2,97]

create_sequence_a055512(opts)

OEIS Sequence A055512 - Lattices with n labeled elements.

From OEIS A055512:

Lattices with n labeled elements. (Formerly )

Sequence IDs: :a055512

Finite: False

Offset: 0

Example

iex> Sequence.create(Elixir.Chunky.Sequence.OEIS.Core, :a055512) |> Sequence.take!(19)
[1,1,2,6,36,380,6390,157962,5396888,243179064,13938711210,987858368750,84613071940452,8597251494954564,1020353444641839854,139627532137612581090,21788453795572514675760,3840596246648027262079472,758435490711709577216754642]