A088520 -id:A088520 - cp's OEIS frontend

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

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

Offset: 0

N. J. A. Sloane, May 16 1994

Number of ways of writing n as a product of primes.
Number of ways of writing n as a sum of distinct powers of 2.
Continued fraction for golden ratio A001622.
Partial sums of A000007 (characteristic function of 0). - Jeremy Gardiner, Sep 08 2002
An example of an infinite sequence of positive integers whose distinct pairwise concatenations are all primes! - Don Reble, Apr 17 2005
Binomial transform of A000007; inverse binomial transform of A000079. - Philippe Deléham, Jul 07 2005
A063524(a(n)) = 1. - Reinhard Zumkeller, Oct 11 2008
For n >= 0, let M(n) be the matrix with first row = (n n+1) and 2nd row = (n+1 n+2). Then a(n) = absolute value of det(M(n)). - K.V.Iyer, Apr 11 2009
The partial sums give the natural numbers (A000027). - Daniel Forgues, May 08 2009
From Enrique Pérez Herrero, Sep 04 2009: (Start)
a(n) is also tau_1(n) where tau_2(n) is A000005.
a(n) is a completely multiplicative arithmetical function.
a(n) is both squarefree and a perfect square. See A005117 and A000290. (End)
Also smallest divisor of n. - Juri-Stepan Gerasimov, Sep 07 2009
Also decimal expansion of 1/9. - Enrique Pérez Herrero, Sep 18 2009; corrected by Klaus Brockhaus, Apr 02 2010
a(n) is also the number of complete graphs on n nodes. - Pablo Chavez (pchavez(AT)cmu.edu), Sep 15 2009
Totally multiplicative sequence with a(p) = 1 for prime p. Totally multiplicative sequence with a(p) = a(p-1) for prime p. - Jaroslav Krizek, Oct 18 2009
n-th prime minus phi(prime(n)); number of divisors of n-th prime minus number of perfect partitions of n-th prime; the number of perfect partitions of n-th prime number; the number of perfect partitions of n-th noncomposite number. - Juri-Stepan Gerasimov, Oct 26 2009
For all n>0, the sequence of limit values for a(n) = n!*Sum_{k>=n} k/(k+1)!. Also, a(n) = n^0. - Harlan J. Brothers, Nov 01 2009
a(n) is also the number of 0-regular graphs on n vertices. - Jason Kimberley, Nov 07 2009
Differences between consecutive n. - Juri-Stepan Gerasimov, Dec 05 2009
From Matthew Vandermast, Oct 31 2010: (Start)
1) When sequence is read as a regular triangular array, T(n,k) is the coefficient of the k-th power in the expansion of (x^(n+1)-1)/(x-1).
2) Sequence can also be read as a uninomial array with rows of length 1, analogous to arrays of binomial, trinomial, etc., coefficients. In a q-nomial array, T(n,k) is the coefficient of the k-th power in the expansion of ((x^q -1)/(x-1))^n, and row n has a sum of q^n and a length of (q-1)*n + 1. (End)
The number of maximal self-avoiding walks from the NW to SW corners of a 2 X n grid.
When considered as a rectangular array, A000012 is a member of the chain of accumulation arrays that includes the multiplication table A003991 of the positive integers. The chain is ... < A185906 < A000007 < A000012 < A003991 < A098358 < A185904 < A185905 < ... (See A144112 for the definition of accumulation array.) - Clark Kimberling, Feb 06 2011
a(n) = A007310(n+1) (Modd 3) := A193680(A007310(n+1)), n>=0. For general Modd n (not to be confused with mod n) see a comment on A203571. The nonnegative members of the three residue classes Modd 3, called [0], [1], and [2], are shown in the array A088520, if there the third row is taken as class [0] after inclusion of 0. - Wolfdieter Lang, Feb 09 2012
Let M = Pascal's triangle without 1's (A014410) and V = a variant of the Bernoulli numbers A027641 but starting [1/2, 1/6, 0, -1/30, ...]. Then M*V = [1, 1, 1, 1, ...]. - Gary W. Adamson, Mar 05 2012
As a lower triangular array, T is an example of the fundamental generalized factorial matrices of A133314. Multiplying each n-th diagonal by t^n gives M(t) = I/(I-t*S) = I + t*S + (t*S)^2 + ... where S is the shift operator A129184, and T = M(1). The inverse of M(t) is obtained by multiplying the first subdiagonal of T by -t and the other subdiagonals by zero, so A167374 is the inverse of T. Multiplying by t^n/n! gives exp(t*S) with inverse exp(-t*S). - Tom Copeland, Nov 10 2012
The original definition of the meter was one ten-millionth of the distance from the Earth's equator to the North Pole. According to that historical definition, the length of one degree of latitude, that is, 60 nautical miles, would be exactly 111111.111... meters. - Jean-François Alcover, Jun 02 2013
Deficiency of 2^n. - Omar E. Pol, Jan 30 2014
Consider n >= 1 nonintersecting spheres each with surface area S. Define point p on sphere S_i to be a "public point" if and only if there exists a point q on sphere S_j, j != i, such that line segment pq INTERSECT S_i = {p} and pq INTERSECT S_j = {q}; otherwise, p is a "private point". The total surface area composed of exactly all private points on all n spheres is a(n)*S = S. ("The Private Planets Problem" in Zeitz.) - Rick L. Shepherd, May 29 2014
For n>0, digital roots of centered 9-gonal numbers (A060544). - Colin Barker, Jan 30 2015
Product of nonzero digits in base-2 representation of n. - Franklin T. Adams-Watters, May 16 2016
Alternating row sums of triangle A104684. - Wolfdieter Lang, Sep 11 2016
A fixed point of the run length transform. - Chai Wah Wu, Oct 21 2016
Length of period of continued fraction for sqrt(A002522) or sqrt(A002496). - A.H.M. Smeets, Oct 10 2017
a(n) is also the determinant of the (n+1) X (n+1) matrix M defined by M(i,j) = binomial(i,j) for 0 <= i,j <= n, since M is a lower triangular matrix with main diagonal all 1's. - Jianing Song, Jul 17 2018
a(n) is also the determinant of the symmetric n X n matrix M defined by M(i,j) = min(i,j) for 1 <= i,j <= n (see Xavier Merlin reference). - Bernard Schott, Dec 05 2018
a(n) is also the determinant of the symmetric n X n matrix M defined by M(i,j) = tau(gcd(i,j)) for 1 <= i,j <= n (see De Koninck & Mercier reference). - Bernard Schott, Dec 08 2020

			1 + 1/(1 + 1/(1 + 1/(1 + 1/(1 + ...)))) = A001622.
1/9 = 0.11111111111111...
From _Wolfdieter Lang_, Feb 09 2012: (Start)
Modd 7 for nonnegative odd numbers not divisible by 3:
A007310: 1, 5, 7, 11, 13, 17, 19, 23, 25, 29, 31, 35, 37, ...
Modd 3:  1, 1, 1,  1,  1,  1,  1,  1,  1,  1,  1,  1,  1, ...
(End)

John H. Conway and Richard K. Guy, The Book of Numbers, New York: Springer-Verlag, 1996. See p. 186.
J.-M. De Koninck & A. Mercier, 1001 Problèmes en Théorie Classique des Nombres, Problème 692 pp. 90 and 297, Ellipses, Paris, 2004.
Xavier Merlin, Méthodix Algèbre, Exercice 1-a), page 153, Ellipses, Paris, 1995.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
James J. Tattersall, Elementary Number Theory in Nine Chapters, Cambridge University Press, 1999, pages 277, 284.
S. Wolfram, A New Kind of Science, Wolfram Media, 2002; p. 55.
Paul Zeitz, The Art and Craft of Mathematical Problem Solving, The Great Courses, The Teaching Company, 2010 (DVDs and Course Guidebook, Lecture 6: "Pictures, Recasting, and Points of View", pp. 32-34).

Charles R Greathouse IV, Table of n, a(n) for n = 0..10000 [Useful when plotting one sequence against another.]
Jeremiah Bartz, Bruce Dearden, and Joel Iiams, Classes of Gap Balancing Numbers, arXiv:1810.07895 [math.NT], 2018.
Harlan Brothers, Factorial: Summation (formula 06.01.23.0002), The Wolfram Functions Site - _Harlan J. Brothers_, Nov 01 2009
Daniele A. Gewurz and Francesca Merola, Sequences realized as Parker vectors of oligomorphic permutation groups, J. Integer Seqs., Vol. 6, 2003.
A. M. Hinz, S. Klavžar, U. Milutinović, and C. Petr, The Tower of Hanoi - Myths and Maths, Birkhäuser 2013. See page 172. Book's website
L. B. W. Jolley, Summation of Series, Dover, 1961
Jerry Metzger and Thomas Richards, A Prisoner Problem Variation, Journal of Integer Sequences, Vol. 18 (2015), Article 15.2.7.
László Németh, The trinomial transform triangle, J. Int. Seqs., Vol. 21 (2018), Article 18.7.3. Also arXiv:1807.07109 [math.NT], 2018.
Robert Price, Comments on A000012 concerning Elementary Cellular Automata, Jan 31 2016
N. J. A. Sloane, Illustration of initial terms
Michael Z. Spivey and Laura L. Steil, The k-Binomial Transforms and the Hankel Transform, Journal of Integer Sequences, Vol. 9 (2006), Article 06.1.1.
Eric Weisstein's World of Mathematics, Golden Ratio
Eric Weisstein's World of Mathematics, Chromatic Number
Eric Weisstein's World of Mathematics, Graph Cycle
Eric Weisstein's World of Mathematics, Elementary Cellular Automaton
S. Wolfram, A New Kind of Science
G. Xiao, Contfrac
Index entries for "core" sequences
Index entries for characteristic functions
Index entries for continued fractions for constants
Index to divisibility sequences
Index entries for related partition-counting sequences
Index entries for linear recurrences with constant coefficients, signature (1).
Index entries for sequences that are fixed points of mappings

Cf. A000004, A007395, A010701, A000027, A027641, A014410, A211216, A212393, A060544, A051801, A104684.
For other q-nomial arrays, see A007318, A027907, A008287, A035343, A063260, A063265, A171890. - Matthew Vandermast, Oct 31 2010
Cf. A097805, A118800, A130595, A167374, A008284 (multisets).

a000012 = const 1
a000012_list = repeat 1 -- Reinhard Zumkeller, May 07 2012

Magma
```
[1 : n in [0..100]];
```
Maple
```
seq(1, i=0..150);
```

Array[1 &, 50] (* Joseph Biberstine (jrbibers(AT)indiana.edu), Dec 26 2006 *)

makelist(1, n, 1, 30); /* Martin Ettl, Nov 07 2012 */

PARI
```
{a(n) = 1};
```

print([1 for n in range(90)]) # Michael S. Branicky, Apr 04 2022

a(n) = 1.
G.f.: 1/(1-x).
E.g.f.: exp(x).
G.f.: Product_{k>=0} (1 + x^(2^k)). - Zak Seidov, Apr 06 2007
Completely multiplicative with a(p^e) = 1.
Regarded as a square array by antidiagonals, g.f. 1/((1-x)(1-y)), e.g.f. Sum T(n,m) x^n/n! y^m/m! = e^{x+y}, e.g.f. Sum T(n,m) x^n y^m/m! = e^y/(1-x). Regarded as a triangular array, g.f. 1/((1-x)(1-xy)), e.g.f. Sum T(n,m) x^n y^m/m! = e^{xy}/(1-x). - Franklin T. Adams-Watters, Feb 06 2006
Dirichlet g.f.: zeta(s). - Ilya Gutkovskiy, Aug 31 2016
a(n) = Sum_{l=1..n} (-1)^(l+1)*2*cos(Pi*l/(2*n+1)) = 1 identically in n >= 1 (for n=0 one has 0 from the undefined sum). From the Jolley reference, (429) p. 80. Interpretation: consider the n segments between x=0 and the n positive zeros of the Chebyshev polynomials S(2*n, x) (see A049310). Then the sum of the lengths of every other segment starting with the one ending in the largest zero (going from the right to the left) is 1. - Wolfdieter Lang, Sep 01 2016
As a lower triangular matrix, T = M*T^(-1)*M = M*A167374*M, where M(n,k) = (-1)^n A130595(n,k). Note that M = M^(-1). Cf. A118800 and A097805. - Tom Copeland, Nov 15 2016

A113807 Permutation of natural numbers generated by 7-rowed array shown below.

Original entry on oeis.org

1, 13, 2, 15, 12, 3, 27, 16, 11, 4, 29, 26, 17, 10, 5, 41, 30, 25, 18, 9, 6, 43, 40, 31, 24, 19, 8, 7, 55, 44, 39, 32, 23, 20, 14, 57, 54, 45, 38, 33, 22, 21, 69, 58, 53, 46, 37, 34, 28, 71, 68, 59, 52, 47, 36, 35, 83, 72, 67, 60, 51, 48, 42, 85, 82, 73, 66, 61, 50, 49

Offset: 1

Giovanni Teofilatto, Jan 22 2006

nonn

For such arrays A_k see the k-family of 2k-periodic sequences P_k defined in a comment on A203571. There the k residue classes mod n have been defined. The present array is A_7 if the last class, starting with 7, is taken as first class [0] after adding a 0 in front. Then one obtains a permutation of the nonnegative integers. However, each complete residue class also includes its negative members. - Wolfdieter Lang, Feb 02 2012

			1 13 15 27 29 41 43 55 57 69 71 83 85 ... (A113801)
2 12 16 26 30 40 44 54 58 68 72 82 86 ... (A113802)
3 11 17 25 31 39 45 53 59 67 73 81 87 ... (A113803)
4 10 18 24 32 38 46 52 60 66 74 80 88 ... (A113804)
5  9 19 23 33 37 47 51 61 65 75 70 89 ... (A113805)
6  8 20 22 34 36 48 50 62 64 76 78 90 ... (A113806)
7 14 21 28 35 42 49 56 63 70 77 84 91 ... (A008589)

Cf. A088520, A090243, A090298, A092260, A204453.

A-numbers added for array rows by Wolfdieter Lang, Dec 15 2011

More terms from Ray Chandler, Dec 15 2011

A092260 Permutation of natural numbers generated by 6-rowed array shown below.

Original entry on oeis.org

1, 11, 2, 13, 10, 3, 23, 14, 9, 4, 25, 22, 15, 8, 5, 35, 26, 21, 16, 7, 6, 37, 34, 27, 20, 17, 12, 47, 38, 33, 28, 19, 18, 49, 46, 39, 32, 29, 24, 59, 50, 45, 40, 31, 30, 61, 58, 51, 44, 41, 36, 71, 62, 57, 52, 43, 42, 73, 70, 63, 56, 53, 48, 83, 74, 69, 64, 55, 54, 85, 82, 75

Offset: 1

Giovanni Teofilatto, Feb 19 2004

nonn

11 13 23 25 35 37 47 49 59... (A091998)
10 14 22 26 34 38 46 50 58... (A091999)
9 15 21 27 33 39 45 51 57... (A016945)
8 16 20 28 32 40 44 52 56... (A092259)
7 17 19 29 31 41 43 53 55... (A092242)
12 18 24 30 36 42 48 54 60... (A008588, excluding initial term)
For such arrays A_k, here A_6, see a W. Lang comment on A113807, the A_7 case. However, to get the array A_6 one should take the last line as the first one and add a 0 in front (thus obtaining a permutation of the nonnegative integers). - Wolfdieter Lang, Feb 02 2012

Cf. A088520, A090243, A090298, A113807.

Edited and extended by Ray Chandler, Feb 21 2004

A090298 Permutation of natural numbers generated by 5-row array shown below.

Original entry on oeis.org

1, 9, 2, 11, 8, 3, 19, 12, 7, 4, 21, 18, 13, 6, 5, 29, 22, 17, 14, 10, 31, 28, 23, 16, 15, 39, 32, 27, 24, 20, 41, 38, 33, 26, 25, 49, 42, 37, 34, 30, 51, 48, 43, 36, 35, 59, 52, 47, 44, 40, 61, 58, 53, 46, 45, 69, 62, 57, 54, 50, 71, 68, 63, 56, 55, 79, 72, 67, 64, 60, 81, 78

Offset: 1

Giovanni Teofilatto, Jan 25 2004

9 11 19 21 29 31 39... (A090771)
8 12 18 22 28 32 38... (A090772)
7 13 17 23 27 33 37... (A063226)
6 14 16 24 26 34 36... (A090773)
10 15 20 25 30 35 40... (A008587, excluding initial term)
-----------------------------------------------------------
For such arrays A_k, here A_5, see a W. Lang comment on A113807, the A_7 case. However, in order to obtain A_5 one should take the last row as the first one after adding a 0 in front (thus getting a permutation of the nonnegative integers). - Wolfdieter Lang, Feb 02 2012

Cf. A088520, A090243, A092260, A113807.

More terms from Ray Chandler, Feb 01 2004

A115302 Permutation of natural numbers generated by 3-rowed array shown below.

Original entry on oeis.org

1, 4, 2, 7, 5, 3, 10, 8, 6, 13, 11, 9, 16, 14, 12, 19, 17, 15, 22, 20, 18, 25, 23, 21, 28, 26, 24, 31, 29, 27, 34, 32, 30, 37, 35, 33, 40, 38, 36, 43, 41, 39, 46, 44, 42, 49, 47, 45, 52, 50, 48, 55, 53, 51, 58, 56, 54, 61, 59, 57, 64, 62, 60

Offset: 1

Giovanni Teofilatto, Mar 05 2006

4 7 10 13 16 19 22 25...a(n)=3n+1 => A016777
5 8 11 14 17 20 23 26...a(n)=3n+2 => A016789
6 9 12 15 18 21 24 27...a(n)=3n => A008585
Reversing the direction of the diagonals gives A143097. - Jeremy Gardiner, Oct 14 2012.

M. Cerasoli, F. Eugeni and M. Protasi, Elementi di Matematica Discreta, Bologna 1988
Emanuele Munarini and Norma Zagaglia Salvi, Matematica Discreta,UTET, CittaStudiEdizioni, Milano 1997

Cf. A088520, A090243, A090298, A143097.

For n > 1, a(n+5) = a(n) + 6, iff a(n+5)=1.

A090243 Permutation of natural numbers generated by 4-rowed array shown below.

Original entry on oeis.org

1, 7, 2, 11, 6, 3, 13, 10, 5, 4, 19, 14, 9, 8, 23, 18, 15, 12, 25, 22, 17, 16, 31, 26, 21, 20, 35, 30, 27, 24, 37, 34, 29, 28, 43, 38, 33, 32, 47, 42, 39, 36, 49, 46, 41, 40, 55, 50, 45, 44, 59, 54, 51, 48, 61, 58, 53, 52, 67, 62, 57, 56, 71, 66, 63, 60, 73, 70, 65, 64, 79, 74

Offset: 1

Giovanni Teofilatto, Jan 24 2004

7 11 13 19 23 25 31 35 37 43 47 ...
6 10 14 18 22 26 30 34 38 42 46 ...
5  9 15 17 21 27 29 33 39 41 45 ...
8 12 16 20 24 28 32 36 40 44 48 ...

M. Cerasoli, F. Eugeni and M. Protasi, Elementi di Matematica Discreta, Bologna 1988
Emanuele Munarini and Norma Zagaglia Salvi, Matematica Discreta,UTET, CittaStudiEdizioni, Milano 1997

Cf. A088520, A090298, A092260, A113807.

Corrected and extended by Ray Chandler, Jan 30 2004

A203575 Array of certain four complete residue classes (nonnegative members), read by SW-NE antidiagonals.

Original entry on oeis.org

0, 1, 4, 2, 7, 8, 3, 6, 9, 12, 5, 10, 15, 16, 11, 14, 17, 20, 13, 18, 23, 24, 19, 22, 25, 28, 21, 26, 31, 32, 27, 30, 33, 36, 29, 34, 39, 40, 35, 38, 41, 44, 37, 42, 47, 48, 43, 46

Offset: 1

Wolfdieter Lang, Jan 12 2012

See A193682 for the sequence called P_4, with period length 8, which defines the four complete residue classes [m], m = 0,1,2,3, via the equivalence relation  p==q iff P_4(p) = P_4(q).
See a comment on A203571 for the general P_k sequences, and the multiplicative (but not additive) structure of these residue classes.
The row length sequence of this tabf array is [1,2,3,4,4,4,...].
This array defines a certain permutation of the nonnegative integers.

			The array starts
n\m  1   2   3   4
1:   0
2:   1   4
3:   2   7   8
4:   3   6   9  12
5:   5  10  15  16
6:  11  14  17  20
7:  13  18  23  24
8:  19  22  25  28
9:  21  26  31  32
10: 27  30  33  36
...
The sequence P_4(n)=A193682(n), n>=0, is repeated 0, 1, 2, 3, 0, 3, 2, 1, with period length 8. P_4(6)=2, hence 6 belongs to class [2].
Multiplicative structure: 11*23 == 3*1 = 3. Indeed: P_4(11*23) = P_4(253) = P_(5), because 253==5(mod 8), and P_(5)= 3, hence 11*23 belongs to class 3. In general, P_4(p*q) = P_4(P_4(p)*P_4(q)).

Cf.A193682, A088520 (k=3), A090298 (k=5), A092260 (k=6), A113807 (k=7).

The nonnegative members of the four complete residue classes are (see a comment above for their definition):
[0]: 0, 4, 8, 12, 16, 20, 24, 28, 32, 36,...  (A008586)
[1]: 1, 7, 9, 15, 17, 23, 25, 31, 33, 39,...  (A047522)
[2]: 2, 6, 10, 14, 18, 22, 26, 30, 34, 38,... (A016825)
[3]: 3, 5, 11, 13, 19, 21, 27, 29, 35, 37,... (A047621)
In each class the corresponding negative numbers should be included.

cp's OEIS Frontend

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

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Haskell

Magma

Maple

Mathematica

Maxima

PARI

Python

Formula

A113807 Permutation of natural numbers generated by 7-rowed array shown below.

Views

Author

Keywords

Comments

Examples

Crossrefs

Extensions

A092260 Permutation of natural numbers generated by 6-rowed array shown below.

Views

Author

Keywords

Comments

Crossrefs

Extensions

A090298 Permutation of natural numbers generated by 5-row array shown below.

Views

Author

Keywords

Comments

Crossrefs

Extensions

A115302 Permutation of natural numbers generated by 3-rowed array shown below.

Views

Author

Keywords

Comments

References

Crossrefs

Formula

A090243 Permutation of natural numbers generated by 4-rowed array shown below.

Views

Author

Keywords

Comments

References

Crossrefs

Extensions

A203575 Array of certain four complete residue classes (nonnegative members), read by SW-NE antidiagonals.

Views

Author

Keywords

Comments

Examples

Crossrefs

Formula