cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Previous Showing 11-20 of 228 results. Next

A350637 Triangle read by rows: T(n,k) in which row n lists the first n terms of A024916 in reverse order, 1 <= k <= n.

Original entry on oeis.org

1, 4, 1, 8, 4, 1, 15, 8, 4, 1, 21, 15, 8, 4, 1, 33, 21, 15, 8, 4, 1, 41, 33, 21, 15, 8, 4, 1, 56, 41, 33, 21, 15, 8, 4, 1, 69, 56, 41, 33, 21, 15, 8, 4, 1, 87, 69, 56, 41, 33, 21, 15, 8, 4, 1, 99, 87, 69, 56, 41, 33, 21, 15, 8, 4, 1, 127, 99, 87, 69, 56, 41, 33, 21, 15, 8, 4, 1
Offset: 1

Views

Author

Omar E. Pol, Jan 09 2022

Keywords

Comments

T(n,k) is the number of cubic cells (or cubes) in the k-th level starting from the base of the stepped pyramid with n levels described in A245092 (see example).

Examples

			Triangle begins:
    1;
    4,  1;
    8,  4,  1;
   15,  8,  4,  1;
   21, 15,  8,  4,  1;
   33, 21, 15,  8,  4,  1;
   41, 33, 21, 15,  8,  4,  1;
   56, 41, 33, 21, 15,  8,  4,  1;
   69, 56, 41, 33, 21, 15,  8,  4,  1;
   87, 69, 56, 41, 33, 21, 15,  8,  4,  1;
   99, 87, 69, 56, 41, 33, 21, 15,  8,  4,  1;
  127, 99, 87, 69, 56, 41, 33, 21, 15,  8,  4,  1;
...
For n = 9 the lateral view and top view of the stepped pyramid described in A245092 look as shown below:
                        _
     9        1        |_|_
     8        4        |_ _|_
     7        8        |_ _|_|_
     6       15        |_ _ _| |_
     5       21        |_ _ _|_ _|_
     4       33        |_ _ _ _| | |_
     3       41        |_ _ _ _|_|_ _|_
     2       56        |_ _ _ _ _|_|_  |_
     1       69        |_ _ _ _ _|_ _|_ _|
.
   Level   Row 9         Lateral view of
     k     T(9,k)      the stepped pyramid
.
                        _ _ _ _ _ _ _ _ _
                       |_| | | | | | | | |
                       |_ _|_| | | | | | |
                       |_ _|  _|_| | | | |
                       |_ _ _|    _|_| | |
                       |_ _ _|  _|  _ _|_|
                       |_ _ _ _|  _| |
                       |_ _ _ _| |_ _|
                       |_ _ _ _ _|
                       |_ _ _ _ _|
.
                           Top view of
                       the stepped pyramid
.
For n = 9 and k = 1 there are 69 cubic cells in the level 1 starting from the base of the stepped pyramid, so T(9,1) = 69.
For n = 9 and k = 9 there is only one cubic cell in the level k = 9 (the top) of the stepped pyramid, so T(9,9) = 1.
The volume of the stepped pyramid (also the total number of cubic cells) represents the 9th term of the convolution of A000203 and A000027 hence it's equal to A175254(9) = 248, equaling the sum of the 9th row of triangle.
		

Crossrefs

Column k gives A024916 starting in row k.
Row sums give A175254.
Cf. A340423 (analog for the tower described in A221529).

Programs

  • Mathematica
    Join@@Array[Reverse@Array[Sum[#-Mod[#,m],{m,#}]&,#]&,12] (* Giorgos Kalogeropoulos, Jan 12 2022 *)
  • PARI
    row(n) = Vecrev(vector(n, k, sum(i=1, k, k\i*i))); \\ Michel Marcus, Jan 22 2022

Formula

T(n,k) = A024916(A004736(n,k)).
T(n,k) = T(n,k) = A024916(n-k+1).
T(n,k) = Sum_{j=1..n} A272172(j,k).

A236109 Triangle read by rows: another version of A048158, only here the representation of A004125 is symmetric, as in the representation of A024916 and A000203.

Original entry on oeis.org

0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 2, 2, 0, 0, 0, 0, 1, 2, 0, 0, 0, 0, 2, 3, 3, 0, 0, 0, 0, 0, 2, 3, 3, 0, 0, 0, 0, 0, 2, 2, 4, 4, 0, 0, 0, 0, 0, 0, 2, 3, 4, 4, 0, 0, 0, 0, 0, 0, 3, 4, 5, 5, 5, 0, 0, 0, 0, 0, 0, 0, 2, 2, 3, 5, 5, 0, 0, 0, 0, 0, 0, 0, 3
Offset: 1

Views

Author

Omar E. Pol, Jan 26 2014

Keywords

Comments

Row sums give A004125.
For more information see A236104, A237591, A237593, A237270.

Examples

			Triangle begins:
0;
0, 0;
0, 0, 1;
0, 0, 0, 1;
0, 0, 0, 2, 2;
0, 0, 0, 0, 1, 2;
0, 0, 0, 0, 2, 3, 3;
0, 0, 0, 0, 0, 2, 3, 3;
0, 0, 0, 0, 0, 2, 2, 4, 4;
0, 0, 0, 0, 0, 0, 2, 3, 4, 4;
0, 0, 0, 0, 0, 0, 3, 4, 5, 5, 5;
0, 0, 0, 0, 0, 0, 0, 2, 2, 3, 5, 5;
...
For the symmetric representation of A000203, A024916, A004125 in the fourth quadrant using a diagram which arises from the sequence A236104 see below:
--------------------------------------------------
n     A000203  A024916            Diagram
--------------------------------------------------
.                         _ _ _ _ _ _ _ _ _ _ _ _
1        1        1      |_| | | | | | | | | | | |
2        3        4      |_ _|_| | | | | | | | | |
3        4        8      |_ _|  _|_| | | | | | | |
4        7       15      |_ _ _|    _|_| | | | | |
5        6       21      |_ _ _|  _|  _ _|_| | | |
6       12       33      |_ _ _ _|  _| |  _ _|_| |
7        8       41      |_ _ _ _| |_ _|_|    _ _|
8       15       56      |_ _ _ _ _|  _|     |* *
9       13       69      |_ _ _ _ _| |      _|* *
10      18       87      |_ _ _ _ _ _|  _ _|* * *
11      12       99      |_ _ _ _ _ _| |* * * * *
12      28      127      |_ _ _ _ _ _ _|* * * * *
.
The 12th row is ........ 0,0,0,0,0,0,0,2,2,3,5,5
.
The total number of cells in the first n set of symmetric regions of the diagram equals A024916(n). It appears that the total number of cells in the n-th set of symmetric regions of the diagram equals sigma(n) = A000203(n). Example: for n = 12 the 12th row of triangle is 144, 25, 9, 1, hence the alternating sums is 144 - 25 + 9 - 1 = 127. On the other hand we have that A000290(12) - A004125(12) = 144 - 17 = A024916(12) = 127, equaling the total number of cells in the diagram after 12 stages. The number of cells in the 12th set of symmetric regions of the diagram is sigma(12) = A000203(12) = 28. Note that in this case there is only one region. The number of "*"'s is A004125(12) = 17.
		

Crossrefs

A000203 a(n) = sigma(n), the sum of the divisors of n. Also called sigma_1(n).

Original entry on oeis.org

1, 3, 4, 7, 6, 12, 8, 15, 13, 18, 12, 28, 14, 24, 24, 31, 18, 39, 20, 42, 32, 36, 24, 60, 31, 42, 40, 56, 30, 72, 32, 63, 48, 54, 48, 91, 38, 60, 56, 90, 42, 96, 44, 84, 78, 72, 48, 124, 57, 93, 72, 98, 54, 120, 72, 120, 80, 90, 60, 168, 62, 96, 104, 127, 84, 144, 68, 126, 96, 144
Offset: 1

Views

Author

Keywords

Comments

Multiplicative: If the canonical factorization of n into prime powers is the product of p^e(p) then sigma_k(n) = Product_p ((p^((e(p)+1)*k))-1)/(p^k-1).
Sum_{d|n} 1/d^k is equal to sigma_k(n)/n^k. So sequences A017665-A017712 also give the numerators and denominators of sigma_k(n)/n^k for k = 1..24. The power sums sigma_k(n) are in sequences A000203 (this sequence) (k=1), A001157-A001160 (k=2,3,4,5), A013954-A013972 for k = 6,7,...,24. - Ahmed Fares (ahmedfares(AT)my-deja.com), Apr 05 2001
A number n is abundant if sigma(n) > 2n (cf. A005101), perfect if sigma(n) = 2n (cf. A000396), deficient if sigma(n) < 2n (cf. A005100).
a(n) is the number of sublattices of index n in a generic 2-dimensional lattice. - Avi Peretz (njk(AT)netvision.net.il), Jan 29 2001 [In the language of group theory, a(n) is the number of index-n subgroups of Z x Z. - Jianing Song, Nov 05 2022]
The sublattices of index n are in one-to-one correspondence with matrices [a b; 0 d] with a>0, ad=n, b in [0..d-1]. The number of these is Sum_{d|n} d = sigma(n), which is a(n). A sublattice is primitive if gcd(a,b,d) = 1; the number of these is n * Product_{p|n} (1+1/p), which is A001615. [Cf. Grady reference.]
Sum of number of common divisors of n and m, where m runs from 1 to n. - Naohiro Nomoto, Jan 10 2004
a(n) is the cardinality of all extensions over Q_p with degree n in the algebraic closure of Q_p, where p>n. - Volker Schmitt (clamsi(AT)gmx.net), Nov 24 2004. Cf. A100976, A100977, A100978 (p-adic extensions).
Let s(n) = a(n-1) + a(n-2) - a(n-5) - a(n-7) + a(n-12) + a(n-15) - a(n-22) - a(n-26) + ..., then a(n) = s(n) if n is not pentagonal, i.e., n != (3 j^2 +- j)/2 (cf. A001318), and a(n) is instead s(n) - ((-1)^j)*n if n is pentagonal. - Gary W. Adamson, Oct 05 2008 [corrected Apr 27 2012 by William J. Keith based on Ewell and by Andrey Zabolotskiy, Apr 08 2022]
Write n as 2^k * d, where d is odd. Then a(n) is odd if and only if d is a square. - Jon Perry, Nov 08 2012
Also total number of parts in the partitions of n into equal parts. - Omar E. Pol, Jan 16 2013
Note that sigma(3^4) = 11^2. On the other hand, Kanold (1947) shows that the equation sigma(q^(p-1)) = b^p has no solutions b > 2, q prime, p odd prime. - N. J. A. Sloane, Dec 21 2013, based on postings to the Number Theory Mailing List by Vladimir Letsko and Luis H. Gallardo
Limit_{m->infinity} (Sum_{n=1..prime(m)} a(n)) / prime(m)^2 = zeta(2)/2 = Pi^2/12 (A072691). See more at A244583. - Richard R. Forberg, Jan 04 2015
a(n) + A000005(n) is an odd number iff n = 2m^2, m>=1. - Richard R. Forberg, Jan 15 2015
a(n) = a(n+1) for n = 14, 206, 957, 1334, 1364 (A002961). - Zak Seidov, May 03 2016
Equivalent to the Riemann hypothesis: a(n) < H(n) + exp(H(n))*log(H(n)), for all n>1, where H(n) is the n-th harmonic number (Jeffrey Lagarias). See A057641 for more details. - Ilya Gutkovskiy, Jul 05 2016
a(n) is the total number of even parts in the partitions of 2*n into equal parts. More generally, a(n) is the total number of parts congruent to 0 mod k in the partitions of k*n into equal parts (the comment dated Jan 16 2013 is the case for k = 1). - Omar E. Pol, Nov 18 2019
From Jianing Song, Nov 05 2022: (Start)
a(n) is also the number of order-n subgroups of C_n X C_n, where C_n is the cyclic group of order n. Proof: by the correspondence theorem in the group theory, there is a one-to-one correspondence between the order-n subgroups of C_n X C_n = (Z x Z)/(nZ x nZ) and the index-n subgroups of Z x Z containing nZ x nZ. But an index-n normal subgroup of a (multiplicative) group G contains {g^n : n in G} automatically. The desired result follows from the comment from Naohiro Nomoto above.
The number of subgroups of C_n X C_n that are isomorphic to C_n is A001615(n). (End)

Examples

			For example, 6 is divisible by 1, 2, 3 and 6, so sigma(6) = 1 + 2 + 3 + 6 = 12.
Let L = <V,W> be a 2-dimensional lattice. The 7 sublattices of index 4 are generated by <4V,W>, <V,4W>, <4V,W+-V>, <2V,2W>, <2V+W,2W>, <2V,2W+V>. Compare A001615.
		

References

  • M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards Applied Math. Series 55, 1964 (and various reprintings), p. 840.
  • T. M. Apostol, Introduction to Analytic Number Theory, Springer-Verlag, 1976, page 38.
  • A. T. Benjamin and J. J. Quinn, Proofs that really count: the art of combinatorial proof, M.A.A. 2003, p. 116ff.
  • Florian Cajori, A History of Mathematical Notations, Dover edition (2012), par. 407.
  • L. Comtet, Advanced Combinatorics, Reidel, 1974, p. 162, #16, (6), 2nd formula.
  • G. H. Hardy, Ramanujan: twelve lectures on subjects suggested by his life and work, AMS Chelsea Publishing, Providence, Rhode Island, 2002, pp. 141, 166.
  • H. Hardy and E. M. Wright, An Introduction to the Theory of Numbers, Fifth Edition, Clarendon Press, Oxford, 2003.
  • Ross Honsberger, "Mathematical Gems, Number One," The Dolciani Mathematical Expositions, Published and Distributed by The Mathematical Association of America, page 116.
  • Kanold, Hans Joachim, Kreisteilungspolynome und ungerade vollkommene Zahlen. (German), Ber. Math.-Tagung Tübingen 1946, (1947). pp. 84-87.
  • M. Krasner, Le nombre des surcorps primitifs d'un degré donné et le nombre des surcorps métagaloisiens d'un degré donné d'un corps de nombres p-adiques. Comptes Rendus Hebdomadaires, Académie des Sciences, Paris 254, 255, 1962.
  • A. Lubotzky, Counting subgroups of finite index, Proceedings of the St. Andrews/Galway 93 group theory meeting, Th. 2.1. LMS Lecture Notes Series no. 212 Cambridge University Press 1995.
  • D. S. Mitrinovic et al., Handbook of Number Theory, Kluwer, Section III.1, page 77.
  • G. Pólya, Induction and Analogy in Mathematics, vol. 1 of Mathematics and Plausible Reasoning, Princeton Univ Press 1954, page 92.
  • N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
  • 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 91, 395.
  • Robert M. Young, Excursions in Calculus, The Mathematical Association of America, 1992 p. 361.

Crossrefs

See A034885, A002093 for records. Bisections give A008438, A062731. Values taken are listed in A007609. A054973 is an inverse function.
For partial sums see A024916.
Row sums of A127093.
Cf. A009194, A082062 (gcd(a(n),n) and its largest prime factor), A179931, A192795 (gcd(a(n),A001157(n)) and largest prime factor).
Cf. also A034448 (sum of unitary divisors).
Cf. A007955 (products of divisors).
A001227, A000593 and this sequence have the same parity: A053866. - Omar E. Pol, May 14 2016

Programs

  • GAP
    A000203:=List([1..10^2],n->Sigma(n)); # Muniru A Asiru, Oct 01 2017
    
  • Haskell
    a000203 n = product $ zipWith (\p e -> (p^(e+1)-1) `div` (p-1)) (a027748_row n) (a124010_row n)
    -- Reinhard Zumkeller, May 07 2012
    
  • Magma
    [SumOfDivisors(n): n in [1..70]];
    
  • Magma
    [DivisorSigma(1,n): n in [1..70]]; // Bruno Berselli, Sep 09 2015
    
  • Maple
    with(numtheory): A000203 := n->sigma(n); seq(A000203(n), n=1..100);
  • Mathematica
    Table[ DivisorSigma[1, n], {n, 100}]
    a[ n_] := SeriesCoefficient[ QPolyGamma[ 1, 1, q] / Log[q]^2, {q, 0, n}]; (* Michael Somos, Apr 25 2013 *)
  • Maxima
    makelist(divsum(n),n,1,1000); /* Emanuele Munarini, Mar 26 2011 */
    
  • MuPAD
    numlib::sigma(n)$ n=1..81 // Zerinvary Lajos, May 13 2008
    
  • PARI
    {a(n) = if( n<1, 0, sigma(n))};
    
  • PARI
    {a(n) = if( n<1, 0, direuler( p=2, n, 1 / (1 - X) /(1 - p*X))[n])};
    
  • PARI
    {a(n) = if( n<1, 0, polcoeff( sum( k=1, n, x^k / (1 - x^k)^2, x * O(x^n)), n))}; /* Michael Somos, Jan 29 2005 */
    
  • PARI
    max_n = 30; ser = - sum(k=1,max_n,log(1-x^k)); a(n) = polcoeff(ser,n)*n \\ Gottfried Helms, Aug 10 2009
    
  • Python
    from sympy import divisor_sigma
    def a(n): return divisor_sigma(n, 1)
    print([a(n) for n in range(1, 71)]) # Michael S. Branicky, Jan 03 2021
    
  • Python
    from math import prod
    from sympy import factorint
    def a(n): return prod((p**(e+1)-1)//(p-1) for p, e in factorint(n).items())
    print([a(n) for n in range(1, 51)]) # Michael S. Branicky, Feb 25 2024
    (APL, Dyalog dialect) A000203 ← +/{ð←⍵{(0=⍵|⍺)/⍵}⍳⌊⍵*÷2 ⋄ 1=⍵:ð ⋄ ð,(⍵∘÷)¨(⍵=(⌊⍵*÷2)*2)↓⌽ð} ⍝ Antti Karttunen, Feb 20 2024
  • SageMath
    [sigma(n, 1) for n in range(1, 71)]  # Zerinvary Lajos, Jun 04 2009
    
  • Scheme
    (definec (A000203 n) (if (= 1 n) n (let ((p (A020639 n)) (e (A067029 n))) (* (/ (- (expt p (+ 1 e)) 1) (- p 1)) (A000203 (A028234 n)))))) ;; Uses macro definec from http://oeis.org/wiki/Memoization#Scheme - Antti Karttunen, Nov 25 2017
    
  • Scheme
    (define (A000203 n) (let ((r (sqrt n))) (let loop ((i (inexact->exact (floor r))) (s (if (integer? r) (- r) 0))) (cond ((zero? i) s) ((zero? (modulo n i)) (loop (- i 1) (+ s i (/ n i)))) (else (loop (- i 1) s)))))) ;; (Stand-alone program) - Antti Karttunen, Feb 20 2024
    

Formula

Multiplicative with a(p^e) = (p^(e+1)-1)/(p-1). - David W. Wilson, Aug 01 2001
For the following bounds and many others, see Mitrinovic et al. - N. J. A. Sloane, Oct 02 2017
If n is composite, a(n) > n + sqrt(n).
a(n) < n*sqrt(n) for all n.
a(n) < (6/Pi^2)*n^(3/2) for n > 12.
G.f.: -x*deriv(eta(x))/eta(x) where eta(x) = Product_{n>=1} (1-x^n). - Joerg Arndt, Mar 14 2010
L.g.f.: -log(Product_{j>=1} (1-x^j)) = Sum_{n>=1} a(n)/n*x^n. - Joerg Arndt, Feb 04 2011
Dirichlet convolution of phi(n) and tau(n), i.e., a(n) = sum_{d|n} phi(n/d)*tau(d), cf. A000010, A000005.
a(n) is odd iff n is a square or twice a square. - Robert G. Wilson v, Oct 03 2001
a(n) = a(n*prime(n)) - prime(n)*a(n). - Labos Elemer, Aug 14 2003 (Clarified by Omar E. Pol, Apr 27 2016)
a(n) = n*A000041(n) - Sum_{i=1..n-1} a(i)*A000041(n-i). - Jon Perry, Sep 11 2003
a(n) = -A010815(n)*n - Sum_{k=1..n-1} A010815(k)*a(n-k). - Reinhard Zumkeller, Nov 30 2003
a(n) = f(n, 1, 1, 1), where f(n, i, x, s) = if n = 1 then s*x else if p(i)|n then f(n/p(i), i, 1+p(i)*x, s) else f(n, i+1, 1, s*x) with p(i) = i-th prime (A000040). - Reinhard Zumkeller, Nov 17 2004
Recurrence: n^2*(n-1)*a(n) = 12*Sum_{k=1..n-1} (5*k*(n-k) - n^2)*a(k)*a(n-k), if n>1. - Dominique Giard (dominique.giard(AT)gmail.com), Jan 11 2005
G.f.: Sum_{k>0} k * x^k / (1 - x^k) = Sum_{k>0} x^k / (1 - x^k)^2. Dirichlet g.f.: zeta(s)*zeta(s-1). - Michael Somos, Apr 05 2003. See the Hardy-Wright reference, p. 312. first equation, and p. 250, Theorem 290. - Wolfdieter Lang, Dec 09 2016
For odd n, a(n) = A000593(n). For even n, a(n) = A000593(n) + A074400(n/2). - Jonathan Vos Post, Mar 26 2006
Equals the inverse Moebius transform of the natural numbers. Equals row sums of A127093. - Gary W. Adamson, May 20 2007
A127093 * [1/1, 1/2, 1/3, ...] = [1/1, 3/2, 4/3, 7/4, 6/5, 12/6, 8/7, ...]. Row sums of triangle A135539. - Gary W. Adamson, Oct 31 2007
a(n) = A054785(2*n) - A000593(2*n). - Reinhard Zumkeller, Apr 23 2008
a(n) = n*Sum_{k=1..n} A060642(n,k)/k*(-1)^(k+1). - Vladimir Kruchinin, Aug 10 2010
Dirichlet convolution of A037213 and A034448. - R. J. Mathar, Apr 13 2011
G.f.: A(x) = x/(1-x)*(1 - 2*x*(1-x)/(G(0) - 2*x^2 + 2*x)); G(k) = -2*x - 1 - (1+x)*k + (2*k+3)*(x^(k+2)) - x*(k+1)*(k+3)*((-1 + (x^(k+2)))^2)/G(k+1); (continued fraction). - Sergei N. Gladkovskii, Dec 06 2011
a(n) = A001065(n) + n. - Mats Granvik, May 20 2012
a(n) = A006128(n) - A220477(n). - Omar E. Pol, Jan 17 2013
a(n) = Sum_{k=1..A003056(n)} (-1)^(k-1)*A196020(n,k). - conjectured by Omar E. Pol, Feb 02 2013, and proved by Max Alekseyev, Nov 17 2013
a(n) = Sum_{k=1..A003056(n)} (-1)^(k-1)*A000330(k)*A000716(n-A000217(k)). - Mircea Merca, Mar 05 2014
a(n) = A240698(n, A000005(n)). - Reinhard Zumkeller, Apr 10 2014
a(n) = Sum_{d^2|n} A001615(n/d^2) = Sum_{d^3|n} A254981(n/d^3). - Álvar Ibeas, Mar 06 2015
a(3*n) = A144613(n). a(3*n + 1) = A144614(n). a(3*n + 2) = A144615(n). - Michael Somos, Jul 19 2015
a(n) = Sum{i=1..n} Sum{j=1..i} cos((2*Pi*n*j)/i). - Michel Lagneau, Oct 14 2015
a(n) = A000593(n) + A146076(n). - Omar E. Pol, Apr 05 2016
a(n) = A065475(n) + A048050(n). - Omar E. Pol, Nov 28 2016
a(n) = (Pi^2*n/6)*Sum_{q>=1} c_q(n)/q^2, with the Ramanujan sums c_q(n) given in A054533 as a c_n(k) table. See the Hardy reference, p. 141, or Hardy-Wright, Theorem 293, p. 251. - Wolfdieter Lang, Jan 06 2017
G.f. also (1 - E_2(q))/24, with the g.f. E_2 of A006352. See e.g., Hardy, p. 166, eq. (10.5.5). - Wolfdieter Lang, Jan 31 2017
From Antti Karttunen, Nov 25 2017: (Start)
a(n) = A048250(n) + A162296(n).
a(n) = A092261(n) * A295294(n). [This can be further expanded, see comment in A291750.] (End)
a(n) = A000593(n) * A038712(n). - Ivan N. Ianakiev and Omar E. Pol, Nov 26 2017
a(n) = Sum_{q=1..n} c_q(n) * floor(n/q), where c_q(n) is the Ramanujan's sum function given in A054533. - Daniel Suteu, Jun 14 2018
a(n) = Sum_{k=1..n} gcd(n, k) / phi(n / gcd(n, k)), where phi(k) is the Euler totient function. - Daniel Suteu, Jun 21 2018
a(n) = (2^(1 + (A000005(n) - A001227(n))/(A000005(n) - A183063(n))) - 1)*A000593(n) = (2^(1 + (A183063(n)/A001227(n))) - 1)*A000593(n). - Omar E. Pol, Nov 03 2018
a(n) = Sum_{i=1..n} tau(gcd(n, i)). - Ridouane Oudra, Oct 15 2019
From Peter Bala, Jan 19 2021: (Start)
G.f.: A(x) = Sum_{n >= 1} x^(n^2)*(x^n + n*(1 - x^(2*n)))/(1 - x^n)^2 - differentiate equation 5 in Arndt w.r.t. x, and set x = 1.
A(x) = F(x) + G(x), where F(x) is the g.f. of A079667 and G(x) is the g.f. of A117004. (End)
a(n) = Sum_{k=1..n} tau(n/gcd(n,k))*phi(gcd(n,k))/phi(n/gcd(n,k)). - Richard L. Ollerton, May 07 2021
With the convention that a(n) = 0 for n <= 0 we have the recurrence a(n) = t(n) + Sum_{k >= 1} (-1)^(k+1)*(2*k + 1)*a(n - k*(k + 1)/2), where t(n) = (-1)^(m+1)*(2*m+1)*n/3 if n = m*(m + 1)/2, with m positive, is a triangular number else t(n) = 0. For example, n = 10 = (4*5)/2 is a triangular number, t(10) = -30, and so a(10) = -30 + 3*a(9) - 5*a(7) + 7*a(4) = -30 + 39 - 40 + 49 = 18. - Peter Bala, Apr 06 2022
Recurrence: a(p^x) = p*a(p^(x-1)) + 1, if p is prime and for any integer x. E.g., a(5^3) = 5*a(5^2) + 1 = 5*31 + 1 = 156. - Jules Beauchamp, Nov 11 2022
Sum_{n>=1} a(n)/exp(2*Pi*n) = 1/24 - 1/(8*Pi) = A319462. - Vaclav Kotesovec, May 07 2023
a(n) < (7n*A001221(n) + 10*n)/6 [Duncan, 1961] (see Duncan and Tattersall). - Stefano Spezia, Jul 13 2025

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

Original entry on oeis.org

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
Offset: 0

Views

Author

Keywords

Comments

a(n) is the number of balls in a triangular pyramid in which each edge contains n balls.
One of the 5 Platonic polyhedral (tetrahedral, cube, octahedral, dodecahedral and icosahedral) numbers (cf. A053012).
Also (1/6)*(n^3 + 3*n^2 + 2*n) is the number of ways to color the vertices of a triangle using <= n colors, allowing rotations and reflections. Group is the dihedral group D_6 with cycle index (x1^3 + 2*x3 + 3*x1*x2)/6.
Also the convolution of the natural numbers with themselves. - Felix Goldberg (felixg(AT)tx.technion.ac.il), Feb 01 2001
Connected with the Eulerian numbers (1, 4, 1) via 1*a(n-2) + 4*a(n-1) + 1*a(n) = n^3. - Gottfried Helms, Apr 15 2002
a(n) is sum of all the possible products p*q where (p,q) are ordered pairs and p + q = n + 1. E.g., a(5) = 5 + 8 + 9 + 8 + 5 = 35. - Amarnath Murthy, May 29 2003
Number of labeled graphs on n+3 nodes that are triangles. - Jon Perry, Jun 14 2003
Number of permutations of n+3 which have exactly 1 descent and avoid the pattern 1324. - Mike Zabrocki, Nov 05 2004
Schlaefli symbol for this polyhedron: {3,3}.
Transform of n^2 under the Riordan array (1/(1-x^2), x). - Paul Barry, Apr 16 2005
a(n) is a perfect square only for n = {1, 2, 48}. E.g., a(48) = 19600 = 140^2. - Alexander Adamchuk, Nov 24 2006
a(n+1) is the number of terms in the expansion of (a_1 + a_2 + a_3 + a_4)^n. - Sergio Falcon, Feb 12 2007 [Corrected by Graeme McRae, Aug 28 2007]
a(n+1) is the number of terms in the complete homogeneous symmetric polynomial of degree n in 3 variables. - Richard Barnes, Sep 06 2017
This is also the average "permutation entropy", sum((pi(n)-n)^2)/n!, over the set of all possible n! permutations pi. - Jeff Boscole (jazzerciser(AT)hotmail.com), Mar 20 2007
a(n) = (d/dx)(S(n, x), x)|A049310.%20-%20_Wolfdieter%20Lang">{x = 2}. First derivative of Chebyshev S-polynomials evaluated at x = 2. See A049310. - _Wolfdieter Lang, Apr 04 2007
If X is an n-set and Y a fixed (n-1)-subset of X then a(n-2) is equal to the number of 3-subsets of X intersecting Y. - Milan Janjic, Aug 15 2007
Complement of A145397; A023533(a(n))=1; A014306(a(n))=0. - Reinhard Zumkeller, Oct 14 2008
Equals row sums of triangle A152205. - Gary W. Adamson, Nov 29 2008
a(n) is the number of gifts received from the lyricist's true love up to and including day n in the song "The Twelve Days of Christmas". a(12) = 364, almost the number of days in the year. - Bernard Hill (bernard(AT)braeburn.co.uk), Dec 05 2008
Sequence of the absolute values of the z^1 coefficients of the polynomials in the GF2 denominators of A156925. See A157703 for background information. - Johannes W. Meijer, Mar 07 2009
Starting with 1 = row sums of triangle A158823. - Gary W. Adamson, Mar 28 2009
Wiener index of the path with n edges. - Eric W. Weisstein, Apr 30 2009
This is a 'Matryoshka doll' sequence with alpha=0, the multiplicative counterpart is A000178: seq(add(add(i,i=alpha..k),k=alpha..n),n=alpha..50). - Peter Luschny, Jul 14 2009
a(n) is the number of nondecreasing triples of numbers from a set of size n, and it is the number of strictly increasing triples of numbers from a set of size n+2. - Samuel Savitz, Sep 12 2009 [Corrected and enhanced by Markus Sigg, Sep 24 2023]
a(n) is the number of ordered sequences of 4 nonnegative integers that sum to n. E.g., a(2) = 10 because 2 = 2 + 0 + 0 + 0 = 1 + 1 + 0 + 0 = 0 + 2 + 0 + 0 = 1 + 0 + 1 + 0 = 0 + 1 + 1 + 0 = 0 + 0 + 2 + 0 = 1 + 0 + 0 + 1 = 0 + 1 + 0 + 1 = 0 + 0 + 1 + 1 = 0 + 0 + 0 + 2. - Artur Jasinski, Nov 30 2009
a(n) corresponds to the total number of steps to memorize n verses by the technique described in A173964. - Ibrahima Faye (ifaye2001(AT)yahoo.fr), Feb 22 2010
The number of (n+2)-bit numbers which contain two runs of 1's in their binary expansion. - Vladimir Shevelev, Jul 30 2010
a(n) is also, starting at the second term, the number of triangles formed in n-gons by intersecting diagonals with three diagonal endpoints (see the first column of the table in Sommars link). - Alexandre Wajnberg, Aug 21 2010
Column sums of:
1 4 9 16 25...
1 4 9...
1...
..............
--------------
1 4 10 20 35...
From Johannes W. Meijer, May 20 2011: (Start)
The Ca3, Ca4, Gi3 and Gi4 triangle sums (see A180662 for their definitions) of the Connell-Pol triangle A159797 are linear sums of shifted versions of the duplicated tetrahedral numbers, e.g., Gi3(n) = 17*a(n) + 19*a(n-1) and Gi4(n) = 5*a(n) + a(n-1).
Furthermore the Kn3, Kn4, Ca3, Ca4, Gi3 and Gi4 triangle sums of the Connell sequence A001614 as a triangle are also linear sums of shifted versions of the sequence given above. (End)
a(n-2)=N_0(n), n >= 1, with a(-1):=0, is the number of vertices of n planes in generic position in three-dimensional space. See a comment under A000125 for general arrangement. Comment to Arnold's problem 1990-11, see the Arnold reference, p. 506. - Wolfdieter Lang, May 27 2011
We consider optimal proper vertex colorings of a graph G. Assume that the labeling, i.e., coloring starts with 1. By optimality we mean that the maximum label used is the minimum of the maximum integer label used across all possible labelings of G. Let S=Sum of the differences |l(v) - l(u)|, the sum being over all edges uv of G and l(w) is the label associated with a vertex w of G. We say G admits unique labeling if all possible labelings of G is S-invariant and yields the same integer partition of S. With an offset this sequence gives the S-values for the complete graph on n vertices, n = 2, 3, ... . - K.V.Iyer, Jul 08 2011
Central term of commutator of transverse Virasoro operators in 4-D case for relativistic quantum open strings (ref. Zwiebach). - Tom Copeland, Sep 13 2011
Appears as a coefficient of a Sturm-Liouville operator in the Ovsienko reference on page 43. - Tom Copeland, Sep 13 2011
For n > 0: a(n) is the number of triples (u,v,w) with 1 <= u <= v <= w <= n, cf. A200737. - Reinhard Zumkeller, Nov 21 2011
Regarding the second comment above by Amarnath Murthy (May 29 2003), see A181118 which gives the sequence of ordered pairs. - L. Edson Jeffery, Dec 17 2011
The dimension of the space spanned by the 3-form v[ijk] that couples to M2-brane worldsheets wrapping 3-cycles inside tori (ref. Green, Miller, Vanhove eq. 3.9). - Stephen Crowley, Jan 05 2012
a(n+1) is the number of 2 X 2 matrices with all terms in {0, 1, ..., n} and (sum of terms) = n. Also, a(n+1) is the number of 2 X 2 matrices with all terms in {0, 1, ..., n} and (sum of terms) = 3*n. - Clark Kimberling, Mar 19 2012
Using n + 4 consecutive triangular numbers t(1), t(2), ..., t(n+4), where n is the n-th term of this sequence, create a polygon by connecting points (t(1), t(2)) to (t(2), t(3)), (t(2), t(3)) to (t(3), t(4)), ..., (t(1), t(2)) to (t(n+3), t(n+4)). The area of this polygon will be one-half of each term in this sequence. - J. M. Bergot, May 05 2012
Pisano period lengths: 1, 4, 9, 8, 5, 36, 7, 16, 27, 20, 11, 72, 13, 28, 45, 32, 17,108, 19, 40, ... . (The Pisano sequence modulo m is the auxiliary sequence p(n) = a(n) mod m, n >= 1, for some m. p(n) is periodic for all sequences with rational g.f., like this one, and others. The lengths of the period of p(n) are quoted here for m>=1.) - R. J. Mathar, Aug 10 2012
a(n) is the maximum possible number of rooted triples consistent with any phylogenetic tree (level-0 phylogenetic network) containing exactly n+2 leaves. - Jesper Jansson, Sep 10 2012
For n > 0, the digital roots of this sequence A010888(a(n)) form the purely periodic 27-cycle {1, 4, 1, 2, 8, 2, 3, 3, 3, 4, 7, 4, 5, 2, 5, 6, 6, 6, 7, 1, 7, 8, 5, 8, 9, 9, 9}, which just rephrases the Pisano period length above. - Ant King, Oct 18 2012
a(n) is the number of functions f from {1, 2, 3} to {1, 2, ..., n + 4} such that f(1) + 1 < f(2) and f(2) + 1 < f(3). - Dennis P. Walsh, Nov 27 2012
a(n) is the Szeged index of the path graph with n+1 vertices; see the Diudea et al. reference, p. 155, Eq. (5.8). - Emeric Deutsch, Aug 01 2013
Also the number of permutations of length n that can be sorted by a single block transposition. - Vincent Vatter, Aug 21 2013
From J. M. Bergot, Sep 10 2013: (Start)
a(n) is the 3 X 3 matrix determinant
| C(n,1) C(n,2) C(n,3) |
| C(n+1,1) C(n+1,2) C(n+1,3) |
| C(n+2,1) C(n+2,2) C(n+2,3) |
(End)
In physics, a(n)/2 is the trace of the spin operator S_z^2 for a particle with spin S=n/2. For example, when S=3/2, the S_z eigenvalues are -3/2, -1/2, +1/2, +3/2 and the sum of their squares is 10/2 = a(3)/2. - Stanislav Sykora, Nov 06 2013
a(n+1) = (n+1)*(n+2)*(n+3)/6 is also the dimension of the Hilbert space of homogeneous polynomials of degree n. - L. Edson Jeffery, Dec 12 2013
For n >= 4, a(n-3) is the number of permutations of 1,2...,n with the distribution of up (1) - down (0) elements 0...0111 (n-4 zeros), or, equivalently, a(n-3) is up-down coefficient {n,7} (see comment in A060351). - Vladimir Shevelev, Feb 15 2014
a(n) is one-half the area of the region created by plotting the points (n^2,(n+1)^2). A line connects points (n^2,(n+1)^2) and ((n+1)^2, (n+2)^2) and a line is drawn from (0,1) to each increasing point. From (0,1) to (4,9) the area is 2; from (0,1) to (9,16) the area is 8; further areas are 20,40,70,...,2*a(n). - J. M. Bergot, May 29 2014
Beukers and Top prove that no tetrahedral number > 1 equals a square pyramidal number A000330. - Jonathan Sondow, Jun 21 2014
a(n+1) is for n >= 1 the number of nondecreasing n-letter words over the alphabet [4] = {1, 2, 3, 4} (or any other four distinct numbers). a(2+1) = 10 from the words 11, 22, 33, 44, 12, 13, 14, 23, 24, 34; which is also the maximal number of distinct elements in a symmetric 4 X 4 matrix. Inspired by the Jul 20 2014 comment by R. J. Cano on A000582. - Wolfdieter Lang, Jul 29 2014
Degree of the q-polynomial counting the orbits of plane partitions under the action of the symmetric group S3. Orbit-counting generating function is Product_{i <= j <= k <= n} ( (1 - q^(i + j + k - 1))/(1 - q^(i + j + k - 2)) ). See q-TSPP reference. - Olivier Gérard, Feb 25 2015
Row lengths of tables A248141 and A248147. - Reinhard Zumkeller, Oct 02 2014
If n is even then a(n) = Sum_{k=1..n/2} (2k)^2. If n is odd then a(n) = Sum_{k=0..(n-1)/2} (1+2k)^2. This can be illustrated as stacking boxes inside a square pyramid on plateaus of edge lengths 2k or 2k+1, respectively. The largest k are the 2k X 2k or (2k+1) X (2k+1) base. - R. K. Guy, Feb 26 2015
Draw n lines in general position in the plane. Any three define a triangle, so in all we see C(n,3) = a(n-2) triangles (6 lines produce 4 triangles, and so on). - Terry Stickels, Jul 21 2015
a(n-2) = fallfac(n,3)/3!, n >= 3, is also the number of independent components of an antisymmetric tensor of rank 3 and dimension n. Here fallfac is the falling factorial. - Wolfdieter Lang, Dec 10 2015
Number of compositions (ordered partitions) of n+3 into exactly 4 parts. - Juergen Will, Jan 02 2016
Number of weak compositions (ordered weak partitions) of n-1 into exactly 4 parts. - Juergen Will, Jan 02 2016
For n >= 2 gives the number of multiplications of two nonzero matrix elements in calculating the product of two upper n X n triangular matrices. - John M. Coffey, Jun 23 2016
Terms a(4n+1), n >= 0, are odd, all others are even. The 2-adic valuation of the subsequence of every other term, a(2n+1), n >= 0, yields the ruler sequence A007814. Sequence A275019 gives the 2-adic valuation of a(n). - M. F. Hasler, Dec 05 2016
Does not satisfy Benford's law [Ross, 2012]. - N. J. A. Sloane, Feb 12 2017
C(n+2,3) is the number of ways to select 1 triple among n+2 objects, thus a(n) is the coefficient of x1^(n-1)*x3 in exponential Bell polynomial B_{n+2}(x1,x2,...), hence its link with A050534 and A001296 (see formula). - Cyril Damamme, Feb 26 2018
a(n) is also the number of 3-cycles in the (n+4)-path complement graph. - Eric W. Weisstein, Apr 11 2018
a(n) is the general number of all geodetic graphs of diameter n homeomorphic to a complete graph K4. - Carlos Enrique Frasser, May 24 2018
a(n) + 4*a(n-1) + a(n-2) = n^3 = A000578(n), for n >= 0 (extending the a(n) formula given in the name). This is the Worpitzky identity for cubes. (Number of components of the decomposition of a rank 3 tensor in dimension n >= 1 into symmetric, mixed and antisymmetric parts). For a(n-2) see my Dec 10 2015 comment. - Wolfdieter Lang, Jul 16 2019
a(n) also gives the total number of regular triangles of length k (in some length unit), with k from {1, 2, ..., n}, in the matchstick arrangement with enclosing triangle of length n, but only triangles with the orientation of the enclosing triangle are counted. Row sums of unsigned A122432(n-1, k-1), for n >= 1. See the Andrew Howroyd comment in A085691. - Wolfdieter Lang, Apr 06 2020
a(n) is the number of bigrassmannian permutations on n+1 elements, i.e., permutations which have a unique left descent, and a unique right descent. - Rafael Mrden, Aug 21 2020
a(n-2) is the number of chiral pairs of colorings of the edges or vertices of a triangle using n or fewer colors. - Robert A. Russell, Oct 20 2020
a(n-2) is the number of subsets of {1,2,...,n} whose diameters are their size. For example, for n=4, a(2)=4 and the sets are {1,3}, {2,4}, {1,2,4}, {1,3,4}. - Enrique Navarrete, Dec 26 2020
For n>1, a(n-2) is the number of subsets of {1,2,...,n} in which the second largest element is the size of the subset. For example, for n=4, a(2)=4 and the sets are {2,3}, {2,4}, {1,3,4}, {2,3,4}. - Enrique Navarrete, Jan 02 2021
a(n) is the number of binary strings of length n+2 with exactly three 0's. - Enrique Navarrete, Jan 15 2021
From Tom Copeland, Jun 07 2021: (Start)
Aside from the zero, this sequence is the fourth diagonal of the Pascal matrix A007318 and the only nonvanishing diagonal (fourth) of the matrix representation IM = (A132440)^3/3! of the differential operator D^3/3!, when acting on the row vector of coefficients of an o.g.f., or power series.
M = e^{IM} is the lower triangular matrix of coefficients of the Appell polynomial sequence p_n(x) = e^{D^3/3!} x^n = e^{b. D} x^n = (b. + x)^n = Sum_{k=0..n} binomial(n,k) b_n x^{n-k}, where the (b.)^n = b_n have the e.g.f. e^{b.t} = e^{t^3/3!}, which is that for A025035 aerated with double zeros, the first column of M.
See A099174 and A000332 for analogous relationships for the third and fifth diagonals of the Pascal matrix. (End)
a(n) is the number of circles with a radius of integer length >= 1 and center at a grid point in an n X n grid. - Albert Swafford, Jun 11 2021
Maximum Wiener index over all connected graphs with n+1 vertices. - Allan Bickle, Jul 09 2022
The third Euler row (1,4,1) has an additional connection with the tetrahedral numbers besides the n^3 identity stated above: a^2(n) + 4*a^2(n+1) + a^2(n+2) = a(n^2+4n+4), which can be shown with algebra. E.g., a^2(2) + 4*a^2(3) + a^2(4) = 16 + 400 + 400 = a(16). Although an analogous thing happens with the (1,1) row of Euler's triangle and triangular numbers C(n+1,2) = A000217(n) = T(n), namely both T(n-1) + T(n) = n^2 and T^2(n-1) + T^2(n) = T(n^2) are true, only one (the usual identity) still holds for the Euler row (1,11,11,1) and the C(n,4) numbers in A000332. That is, the dot product of (1,11,11,1) with the squares of 4 consecutive terms of A000332 is not generally a term of A000332. - Richard Peterson, Aug 21 2022
For n > 1, a(n-2) is the number of solutions of the Diophantine equation x1 + x2 + x3 + x4 + x5 = n, subject to the constraints 0 <= x1, 1 <= x2, 2 <= x3, 0 <= x4 <= 1, 0 <= x5 and x5 is even. - Daniel Checa, Nov 03 2022
a(n+1) is also the number of vertices of the generalized Pitman-Stanley polytope with parameters 2, n, and vector (1,1, ... ,1), which is integrally equivalent to a flow polytope over the grid graph having 2 rows and n columns. - William T. Dugan, Sep 18 2023
a(n) is the number of binary words of length (n+1) containing exactly one substring 01. a(2) = 4: 001, 010, 011, 101. - Nordine Fahssi, Dec 09 2024
a(n) is the number of directed bishop moves on an n X n chessboard, identified under rotations (0, 90, 180 and 270 degree) and all reflections. - Hilko Koning, Aug 27 2025

Examples

			a(2) = 3*4*5/6 = 10, the number of balls in a pyramid of 3 layers of balls, 6 in a triangle at the bottom, 3 in the middle layer and 1 on top.
Consider the square array
  1  2  3  4  5  6 ...
  2  4  6  8 10 12 ...
  3  6  9 12 16 20 ...
  4  8 12 16 20 24 ...
  5 10 15 20 25 30 ...
  ...
then a(n) = sum of n-th antidiagonal. - _Amarnath Murthy_, Apr 06 2003
G.f. = x + 4*x^2 + 10*x^3 + 20*x^4 + 35*x^5 + 56*x^6 + 84*x^7 + 120*x^8 + 165*x^9 + ...
Example for a(3+1) = 20 nondecreasing 3-letter words over {1,2,3,4}: 111, 222, 333; 444, 112, 113, 114, 223, 224, 122, 224, 133, 233, 144, 244, 344; 123, 124, 134, 234.  4 + 4*3 + 4 = 20. - _Wolfdieter Lang_, Jul 29 2014
Example for a(4-2) = 4 independent components of a rank 3 antisymmetric tensor A of dimension 4: A(1,2,3), A(1,2,4), A(1,3,4) and A(2,3,4). - _Wolfdieter Lang_, Dec 10 2015
		

References

  • M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards Applied Math. Series 55, 1964 (and various reprintings), p. 828.
  • V. I. Arnold (ed.), Arnold's Problems, Springer, 2004, comments on Problem 1990-11 (p. 75), pp. 503-510. Numbers N_0.
  • A. H. Beiler, Recreations in the Theory of Numbers, Dover, NY, 1964, p. 194.
  • J. H. Conway and R. K. Guy, The Book of Numbers, Copernicus Press, NY, 1996, pp. 44, 70.
  • H. S. M. Coxeter, Polyhedral numbers, pp. 25-35 of R. S. Cohen, J. J. Stachel and M. W. Wartofsky, eds., For Dirk Struik: Scientific, historical and political essays in honor of Dirk J. Struik, Reidel, Dordrecht, 1974.
  • E. Deza and M. M. Deza, Figurate numbers, World Scientific Publishing (2012), page 93.
  • L. E. Dickson, History of the Theory of Numbers. Carnegie Institute Public. 256, Washington, DC, Vol. 1, 1919; Vol. 2, 1920; Vol. 3, 1923, see vol. 2, p. 4.
  • M. V. Diudea, I. Gutman, and J. Lorentz, Molecular Topology, Nova Science, 2001, Huntington, N.Y. pp. 152-156.
  • Jan Gullberg, Mathematics from the Birth of Numbers, W. W. Norton & Co., NY & London, 1997, §8.6 Figurate Numbers, pp. 292-293.
  • J. C. P. Miller, editor, Table of Binomial Coefficients. Royal Society Mathematical Tables, Vol. 3, Cambridge Univ. Press, 1954.
  • V. Ovsienko and S. Tabachnikov, Projective Differential Geometry Old and New, Cambridge Tracts in Mathematics (no. 165), Cambridge Univ. Press, 2005.
  • Kenneth A Ross, First Digits of Squares and Cubes, Math. Mag. 85 (2012) 36-42. doi:10.4169/math.mag.85.1.36.
  • N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
  • N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
  • A. Szenes, The combinatorics of the Verlinde formulas (N.J. Hitchin et al., ed.), in Vector bundles in algebraic geometry, Cambridge, 1995.
  • James J. Tattersall, Elementary Number Theory in Nine Chapters, Cambridge University Press, 1999, pages 11-13.
  • D. Wells, The Penguin Dictionary of Curious and Interesting Numbers, Penguin Books, 1987, pp. 126-127.
  • B. Zwiebach, A First Course in String Theory, Cambridge, 2004; see p. 226.

Crossrefs

Bisections give A000447 and A002492.
Sums of 2 consecutive terms give A000330.
a(3n-3) = A006566(n). A000447(n) = a(2n-2). A002492(n) = a(2n+1).
Column 0 of triangle A094415.
Partial sums are A000332. - Jonathan Vos Post, Mar 27 2011
Cf. A216499 (the analogous sequence for level-1 phylogenetic networks).
Cf. A068980 (partitions), A231303 (spin physics).
Cf. similar sequences listed in A237616.
Cf. A104712 (second column, if offset is 2).
Cf. A145397 (non-tetrahedral numbers). - Daniel Forgues, Apr 11 2015
Cf. A127324.
Cf. A007814, A275019 (2-adic valuation).
Cf. A000578 (cubes), A005900 (octahedral numbers), A006566 (dodecahedral numbers), A006564 (icosahedral numbers).
Cf. A002817 (4-cycle count of \bar P_{n+4}), A060446 (5-cycle count of \bar P_{n+3}), A302695 (6-cycle count of \bar P_{n+5})
Row 2 of A325000 (simplex facets and vertices) and A327084 (simplex edges and ridges).
Cf. A085691 (matchsticks), A122432 (unsigned row sums).
Cf. (triangle colorings) A006527 (oriented), A000290 (achiral), A327085 (chiral simplex edges and ridges).
Row 3 of A321791 (cycles of n colors using k or fewer colors).
The Wiener indices of powers of paths for k = 1..6 are given in A000292, A002623, A014125, A122046, A122047, and A175724, respectively.

Programs

  • GAP
    a:=n->Binomial(n+2,3);; A000292:=List([0..50],n->a(n)); # Muniru A Asiru, Feb 28 2018
    
  • Haskell
    a000292 n = n * (n + 1) * (n + 2) `div` 6
    a000292_list = scanl1 (+) a000217_list
    -- Reinhard Zumkeller, Jun 16 2013, Feb 09 2012, Nov 21 2011
    
  • Magma
    [n*(n+1)*(n+2)/6: n in [0..50]]; // Wesley Ivan Hurt, Jun 03 2014
    
  • Maple
    a:=n->n*(n+1)*(n+2)/6; seq(a(n), n=0..50);
    A000292 := n->binomial(n+2,3); seq(A000292(n), n=0..50);
    isA000292 := proc(n)
        option remember;
        local a,i ;
        for i from iroot(6*n,3)-1 do
            a := A000292(i) ;
            if a > n then
                return false;
            elif a = n then
                return true;
            end if;
        end do:
    end proc: # R. J. Mathar, Aug 14 2024
  • Mathematica
    Table[Binomial[n + 2, 3], {n, 0, 20}] (* Zerinvary Lajos, Jan 31 2010 *)
    Accumulate[Accumulate[Range[0, 50]]] (* Harvey P. Dale, Dec 10 2011 *)
    Table[n (n + 1)(n + 2)/6, {n,0,100}] (* Wesley Ivan Hurt, Sep 25 2013 *)
    Nest[Accumulate, Range[0, 50], 2] (* Harvey P. Dale, May 24 2017 *)
    Binomial[Range[20] + 1, 3] (* Eric W. Weisstein, Sep 08 2017 *)
    LinearRecurrence[{4, -6, 4, -1}, {0, 1, 4, 10}, 20] (* Eric W. Weisstein, Sep 08 2017 *)
    CoefficientList[Series[x/(-1 + x)^4, {x, 0, 20}], x] (* Eric W. Weisstein, Sep 08 2017 *)
    Table[Range[n].Range[n,1,-1],{n,0,50}] (* Harvey P. Dale, Mar 02 2024 *)
  • Maxima
    A000292(n):=n*(n+1)*(n+2)/6$ makelist(A000292(n),n,0,60); /* Martin Ettl, Oct 24 2012 */
    
  • PARI
    a(n) = (n) * (n+1) * (n+2) / 6  \\ corrected by Harry J. Smith, Dec 22 2008
    
  • PARI
    a=vector(10000);a[2]=1;for(i=3,#a,a[i]=a[i-2]+i*i); \\ Stanislav Sykora, Nov 07 2013
    
  • PARI
    is(n)=my(k=sqrtnint(6*n,3)); k*(k+1)*(k+2)==6*n \\ Charles R Greathouse IV, Dec 13 2016
    
  • Python
    # Compare A000217.
    def A000292():
        x, y, z = 1, 1, 1
        yield 0
        while True:
            yield x
            x, y, z = x + y + z + 1, y + z + 1, z + 1
    a = A000292(); print([next(a) for i in range(45)]) # Peter Luschny, Aug 03 2019

Formula

a(n) = C(n+2,3) = n*(n+1)*(n+2)/6 (see the name).
G.f.: x / (1 - x)^4.
a(n) = -a(-4 - n) for all in Z.
a(n) = Sum_{k=0..n} A000217(k) = Sum_{k=1..n} Sum_{j=0..k} j, partial sums of the triangular numbers.
a(2n)= A002492(n). a(2n+1)=A000447(n+1).
a(n) = Sum_{1 <= i <= j <= n} |i - j|. - Amarnath Murthy, Aug 05 2002
a(n) = (n+3)*a(n-1)/n. - Ralf Stephan, Apr 26 2003
Sums of three consecutive terms give A006003. - Ralf Stephan, Apr 26 2003
Determinant of the n X n symmetric Pascal matrix M_(i, j) = C(i+j+2, i). - Benoit Cloitre, Aug 19 2003
The sum of a series constructed by the products of the index and the length of the series (n) minus the index (i): a(n) = sum[i(n-i)]. - Martin Steven McCormick (mathseq(AT)wazer.net), Apr 06 2005
a(n) = Sum_{k=0..floor((n-1)/2)} (n-2k)^2 [offset 0]; a(n+1) = Sum_{k=0..n} k^2*(1-(-1)^(n+k-1))/2 [offset 0]. - Paul Barry, Apr 16 2005
a(n) = -A108299(n+5, 6) = A108299(n+6, 7). - Reinhard Zumkeller, Jun 01 2005
a(n) = -A110555(n+4, 3). - Reinhard Zumkeller, Jul 27 2005
Values of the Verlinde formula for SL_2, with g = 2: a(n) = Sum_{j=1..n-1} n/(2*sin^2(j*Pi/n)). - Simone Severini, Sep 25 2006
a(n-1) = (1/(1!*2!))*Sum_{1 <= x_1, x_2 <= n} |det V(x_1, x_2)| = (1/2)*Sum_{1 <= i,j <= n} |i-j|, where V(x_1, x_2) is the Vandermonde matrix of order 2. Column 2 of A133112. - Peter Bala, Sep 13 2007
Starting with 1 = binomial transform of [1, 3, 3, 1, ...]; e.g., a(4) = 20 = (1, 3, 3, 1) dot (1, 3, 3, 1) = (1 + 9 + 9 + 1). - Gary W. Adamson, Nov 04 2007
a(n) = A006503(n) - A002378(n). - Reinhard Zumkeller, Sep 24 2008
a(n) = 4*a(n-1) - 6*a(n-2) + 4*a(n-3) - a(n-4) for n >= 4. - Jaume Oliver Lafont, Nov 18 2008
Sum_{n>=1} 1/a(n) = 3/2, case x = 1 in Gradstein-Ryshik 1.513.7. - R. J. Mathar, Jan 27 2009
E.g.f.:((x^3)/6 + x^2 + x)*exp(x). - Geoffrey Critzer, Feb 21 2009
Limit_{n -> oo} A171973(n)/a(n) = sqrt(2)/2. - Reinhard Zumkeller, Jan 20 2010
With offset 1, a(n) = (1/6)*floor(n^5/(n^2 + 1)). - Gary Detlefs, Feb 14 2010
a(n) = Sum_{k = 1..n} k*(n-k+1). - Vladimir Shevelev, Jul 30 2010
a(n) = (3*n^2 + 6*n + 2)/(6*(h(n+2) - h(n-1))), n > 0, where h(n) is the n-th harmonic number. - Gary Detlefs, Jul 01 2011
a(n) = coefficient of x^2 in the Maclaurin expansion of 1 + 1/(x+1) + 1/(x+1)^2 + 1/(x+1)^3 + ... + 1/(x+1)^n. - Francesco Daddi, Aug 02 2011
a(n) = coefficient of x^4 in the Maclaurin expansion of sin(x)*exp((n+1)*x). - Francesco Daddi, Aug 04 2011
a(n) = 2*A002415(n+1)/(n+1). - Tom Copeland, Sep 13 2011
a(n) = A004006(n) - n - 1. - Reinhard Zumkeller, Mar 31 2012
a(n) = (A007531(n) + A027480(n) + A007290(n))/11. - J. M. Bergot, May 28 2012
a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3) + 1. - Ant King, Oct 18 2012
G.f.: x*U(0) where U(k) = 1 + 2*x*(k+2)/( 2*k+1 - x*(2*k+1)*(2*k+5)/(x*(2*k+5)+(2*k+2)/U(k+1) )); (continued fraction, 3rd kind, 3-step). - Sergei N. Gladkovskii, Dec 01 2012
a(n^2 - 1) = (1/2)*(a(n^2 - n - 2) + a(n^2 + n - 2)) and
a(n^2 + n - 2) - a(n^2 - 1) = a(n-1)*(3*n^2 - 2) = 10*A024166(n-1), by Berselli's formula in A222716. - Jonathan Sondow, Mar 04 2013
G.f.: x + 4*x^2/(Q(0)-4*x) where Q(k) = 1 + k*(x+1) + 4*x - x*(k+1)*(k+5)/Q(k+1); (continued fraction). - Sergei N. Gladkovskii, Mar 14 2013
a(n+1) = det(C(i+3,j+2), 1 <= i,j <= n), where C(n,k) are binomial coefficients. - Mircea Merca, Apr 06 2013
a(n) = a(n-2) + n^2, for n > 1. - Ivan N. Ianakiev, Apr 16 2013
a(2n) = 4*(a(n-1) + a(n)), for n > 0. - Ivan N. Ianakiev, Apr 26 2013
G.f.: x*G(0)/2, where G(k) = 1 + 1/(1 - x/(x + (k+1)/(k+4)/G(k+1))); (continued fraction). - Sergei N. Gladkovskii, Jun 02 2013
a(n) = n + 2*a(n-1) - a(n-2), with a(0) = a(-1) = 0. - Richard R. Forberg, Jul 11 2013
a(n)*(m+1)^3 + a(m)*(n+1) = a(n*m + n + m), for any nonnegative integers m and n. This is a 3D analog of Euler's theorem about triangular numbers, namely t(n)*(2m+1)^2 + t(m) = t(2nm + n + m), where t(n) is the n-th triangular number. - Ivan N. Ianakiev, Aug 20 2013
Sum_{n>=0} a(n)/(n+1)! = 2*e/3 = 1.8121878856393... . Sum_{n>=1} a(n)/n! = 13*e/6 = 5.88961062832... . - Richard R. Forberg, Dec 25 2013
a(n+1) = A023855(n+1) + A023856(n). - Wesley Ivan Hurt, Sep 24 2013
a(n) = A024916(n) + A076664(n), n >= 1. - Omar E. Pol, Feb 11 2014
a(n) = A212560(n) - A059722(n). - J. M. Bergot, Mar 08 2014
Sum_{n>=1} (-1)^(n + 1)/a(n) = 12*log(2) - 15/2 = 0.8177661667... See A242024, A242023. - Richard R. Forberg, Aug 11 2014
3/(Sum_{n>=m} 1/a(n)) = A002378(m), for m > 0. - Richard R. Forberg, Aug 12 2014
a(n) = Sum_{i=1..n} Sum_{j=i..n} min(i,j). - Enrique Pérez Herrero, Dec 03 2014
Arithmetic mean of Square pyramidal number and Triangular number: a(n) = (A000330(n) + A000217(n))/2. - Luciano Ancora, Mar 14 2015
a(k*n) = a(k)*a(n) + 4*a(k-1)*a(n-1) + a(k-2)*a(n-2). - Robert Israel, Apr 20 2015
Dirichlet g.f.: (zeta(s-3) + 3*zeta(s-2) + 2*zeta(s-1))/6. - Ilya Gutkovskiy, Jul 01 2016
a(n) = A080851(1,n-1) - R. J. Mathar, Jul 28 2016
a(n) = (A000578(n+1) - (n+1) ) / 6. - Zhandos Mambetaliyev, Nov 24 2016
G.f.: x/(1 - x)^4 = (x * r(x) * r(x^2) * r(x^4) * r(x^8) * ...), where r(x) = (1 + x)^4 = (1 + 4x + 6x^2 + 4x^3 + x^4); and x/(1 - x)^4 = (x * r(x) * r(x^3) * r(x^9) * r(x^27) * ...) where r(x) = (1 + x + x^2)^4. - Gary W. Adamson, Jan 23 2017
a(n) = A000332(n+3) - A000332(n+2). - Bruce J. Nicholson, Apr 08 2017
a(n) = A001296(n) - A050534(n+1). - Cyril Damamme, Feb 26 2018
a(n) = Sum_{k=1..n} (-1)^(n-k)*A122432(n-1, k-1), for n >= 1, and a(0) = 0. - Wolfdieter Lang, Apr 06 2020
From Robert A. Russell, Oct 20 2020: (Start)
a(n) = A006527(n) - a(n-2) = (A006527(n) + A000290(n)) / 2 = a(n-2) + A000290(n).
a(n-2) = A006527(n) - a(n) = (A006527(n) - A000290(n)) / 2 = a(n) - A000290(n).
a(n) = 1*C(n,1) + 2*C(n,2) + 1*C(n,3), where the coefficient of C(n,k) is the number of unoriented triangle colorings using exactly k colors.
a(n-2) = 1*C(n,3), where the coefficient of C(n,k) is the number of chiral pairs of triangle colorings using exactly k colors.
a(n-2) = A327085(2,n). (End)
From Amiram Eldar, Jan 25 2021: (Start)
Product_{n>=1} (1 + 1/a(n)) = sinh(sqrt(2)*Pi)/(3*sqrt(2)*Pi).
Product_{n>=2} (1 - 1/a(n)) = sqrt(2)*sinh(sqrt(2)*Pi)/(33*Pi). (End)
a(n) = A002623(n-1) + A002623(n-2), for n>1. - Ivan N. Ianakiev, Nov 14 2021

Extensions

Corrected and edited by Daniel Forgues, May 14 2010

A237593 Triangle read by rows in which row n lists the elements of the n-th row of A237591 followed by the same elements in reverse order.

Original entry on oeis.org

1, 1, 2, 2, 2, 1, 1, 2, 3, 1, 1, 3, 3, 2, 2, 3, 4, 1, 1, 1, 1, 4, 4, 2, 1, 1, 2, 4, 5, 2, 1, 1, 2, 5, 5, 2, 2, 2, 2, 5, 6, 2, 1, 1, 1, 1, 2, 6, 6, 3, 1, 1, 1, 1, 3, 6, 7, 2, 2, 1, 1, 2, 2, 7, 7, 3, 2, 1, 1, 2, 3, 7, 8, 3, 1, 2, 2, 1, 3, 8, 8, 3, 2, 1, 1, 1, 1, 2, 3, 8
Offset: 1

Views

Author

Omar E. Pol, Feb 22 2014

Keywords

Comments

Row n is a palindromic composition of 2*n.
T(n,k) is also the length of the k-th segment in a Dyck path on the first quadrant of the square grid, connecting the x-axis with the y-axis, from (n, 0) to (0, n), starting with a segment in vertical direction, see example.
Conjecture 1: the area under the n-th Dyck path equals A024916(n), the sum of all divisors of all positive integers <= n.
If the conjecture is true then the n-th Dyck path represents the boundary segments after the alternating sum of the elements of the n-th row of A236104.
Conjecture 2: two adjacent Dyck paths never cross (checked by hand up to n = 128), hence the total area between the n-th Dyck path and the (n-1)-st Dyck path is equal to sigma(n) = A000203(n), the sum of divisors of n.
The connection between A196020 and A237271 is as follows: A196020 --> A236104 --> A235791 --> A237591 --> this sequence --> A239660 --> A237270 --> A237271.
PARI scripts area(n) and chkcross(n) have been written to check the 2 properties and have been run up to n=10000. - Michel Marcus, Mar 27 2014
Mathematica functions have been written that verified the 2 properties through n=30000. - Hartmut F. W. Hoft, Apr 07 2014
Comments from Franklin T. Adams-Watters on sequences related to the "symmetric representation of sigma" in A235791 and related sequences, Mar 31 2014: (Start)
The place to start is with A235791, which is very simple. Then go to A237591, also very simple, and A237593, still very simple.
You then need to interpret the rows of A237593 as Dyck paths. This interpretation is in terms of run lengths, so 2,1,1,2 means up twice, down once, up once, and down twice. Because the rows of A237593 are symmetric and of even length, this path will always be symmetric.
Now the surprising fact is that the areas enclosed by the Dyck path for n (laid on its side) always includes the area enclosed for n-1; and the number of squares added is sigma(n).
Finally, look at the connected areas enclosed by n but not by n-1; the size of these areas is the symmetric representation of sigma. (End)
The symmetric representation of sigma, so defined, is row n of A237270. - Peter Munn, Jan 06 2025
It appears that, for the n-th set, the number of cells lying on the first diagonal is equal to A067742(n), the number of middle divisors of n. - Michel Marcus, Jun 21 2014
Checked Michel Marcus's conjecture with two Mathematica functions up to n=100000, for more information see A240542. - Hartmut F. W. Hoft, Jul 17 2014
A003056(n) is also the number of peaks of the Dyck path related to the n-th row of triangle. - Omar E. Pol, Nov 03 2015
The number of peaks of the Dyck path associated to the row A000396(n) of this triangle equals the n-th Mersenne prime A000668(n), hence Mersenne primes are visible in two ways at the pyramid described in A245092. - Omar E. Pol, Dec 19 2016
The limit as n approaches infinity (area under the Dyck path described in the n-th row of triangle divided by n^2) equals Pi^2/12 = zeta(2)/2. (Cf. A072691.) - Omar E. Pol, Dec 18 2021
The connection between the isosceles triangle and the stepped pyramid is due to the fact that this object can also be interpreted as a pop-up card. - Omar E. Pol, Nov 09 2022

Examples

			Triangle begins:
   n
   1 |  1, 1;
   2 |  2, 2;
   3 |  2, 1, 1, 2;
   4 |  3, 1, 1, 3;
   5 |  3, 2, 2, 3;
   6 |  4, 1, 1, 1, 1, 4;
   7 |  4, 2, 1, 1, 2, 4;
   8 |  5, 2, 1, 1, 2, 5;
   9 |  5, 2, 2, 2, 2, 5;
  10 |  6, 2, 1, 1, 1, 1, 2, 6;
  11 |  6, 3, 1, 1, 1, 1, 3, 6;
  12 |  7, 2, 2, 1, 1, 2, 2, 7;
  13 |  7, 3, 2, 1, 1, 2, 3, 7;
  14 |  8, 3, 1, 2, 2, 1, 3, 8;
  15 |  8, 3, 2, 1, 1, 1, 1, 2, 3, 8;
  16 |  9, 3, 2, 1, 1, 1, 1, 2, 3, 9;
  17 |  9, 4, 2, 1, 1, 1, 1, 2, 4, 9;
  18 | 10, 3, 2, 2, 1, 1, 2, 2, 3, 10;
  19 | 10, 4, 2, 2, 1, 1, 2, 2, 4, 10;
  20 | 11, 4, 2, 1, 2, 2, 1, 2, 4, 11;
  21 | 11, 4, 3, 1, 1, 1, 1, 1, 1, 3, 4, 11;
  22 | 12, 4, 2, 2, 1, 1, 1, 1, 2, 2, 4, 12;
  23 | 12, 5, 2, 2, 1, 1, 1, 1, 2, 2, 5, 12;
  24 | 13, 4, 3, 2, 1, 1, 1, 1, 2, 3, 4, 13;
  ...
Illustration of rows 8 and 9 interpreted as Dyck paths in the first quadrant and the illustration of the symmetric representation of sigma(9) = 5 + 3 + 5 = 13, see below:
.
y                       y
.                       .
.                       ._ _ _ _ _                _ _ _ _ _ 5
._ _ _ _ _              .         |              |_ _ _ _ _|
.         |             .         |_ _                     |_ _ 3
.         |_            .             |                    |_  |
.           |_ _        .             |_ _                   |_|_ _ 5
.               |       .                 |                      | |
.   Area = 56   |       .    Area = 69    |          Area = 13   | |
.               |       .                 |                      | |
.               |       .                 |                      | |
. . . . . . . . | . x   . . . . . . . . . | . x                  |_|
.
.    Fig. 1                    Fig. 2                  Fig. 3
.
Figure 1. For n = 8 the 8th row of triangle is [5, 2, 1, 1, 2, 5] and the area under the symmetric Dyck path is equal to A024916(8) = 56.
Figure 2. For n = 9 the 9th row of triangle is [5, 2, 2, 2, 2, 5] and the area under the symmetric Dyck path is equal to A024916(9) = 69.
Figure 3. The symmetric representation of sigma(9): between both symmetric Dyck paths there are three regions (or parts) of sizes [5, 3, 5].
The sum of divisors of 9 is 1 + 3 + 9 = A000203(9) = 13. On the other hand the difference between the areas under the Dyck paths equals the sum of the parts of the symmetric representation of sigma(9) = 69 - 56 = 5 + 3 + 5 = 13, equaling the sum of divisors of 9.
.
Illustration of initial terms as Dyck paths in the first quadrant:
(row n = 1..28)
.  _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
  |_ _ _ _ _ _ _ _ _ _ _ _ _ _  |
  |_ _ _ _ _ _ _ _ _ _ _ _ _ _| |
  |_ _ _ _ _ _ _ _ _ _ _ _ _  | |
  |_ _ _ _ _ _ _ _ _ _ _ _ _| | |
  |_ _ _ _ _ _ _ _ _ _ _ _  | | |_ _ _
  |_ _ _ _ _ _ _ _ _ _ _ _| | |_ _ _  |
  |_ _ _ _ _ _ _ _ _ _ _  | | |_ _  | |_
  |_ _ _ _ _ _ _ _ _ _ _| | |_ _ _| |_  |_
  |_ _ _ _ _ _ _ _ _ _  | |       |_ _|   |_
  |_ _ _ _ _ _ _ _ _ _| | |_ _    |_  |_ _  |_ _
  |_ _ _ _ _ _ _ _ _  | |_ _ _|     |_  | |_ _  |
  |_ _ _ _ _ _ _ _ _| | |_ _  |_      |_|_ _  | |
  |_ _ _ _ _ _ _ _  | |_ _  |_ _|_        | | | |_ _ _ _ _
  |_ _ _ _ _ _ _ _| |     |     | |_ _    | |_|_ _ _ _ _  |
  |_ _ _ _ _ _ _  | |_ _  |_    |_  | |   |_ _ _ _ _  | | |
  |_ _ _ _ _ _ _| |_ _  |_  |_ _  | | |_ _ _ _ _  | | | | |
  |_ _ _ _ _ _  | |_  |_  |_    | |_|_ _ _ _  | | | | | | |
  |_ _ _ _ _ _| |_ _|   |_  |   |_ _ _ _  | | | | | | | | |
  |_ _ _ _ _  |     |_ _  | |_ _ _ _  | | | | | | | | | | |
  |_ _ _ _ _| |_      | |_|_ _ _  | | | | | | | | | | | | |
  |_ _ _ _  |_ _|_    |_ _ _  | | | | | | | | | | | | | | |
  |_ _ _ _| |_  | |_ _ _  | | | | | | | | | | | | | | | | |
  |_ _ _  |_  |_|_ _  | | | | | | | | | | | | | | | | | | |
  |_ _ _|   |_ _  | | | | | | | | | | | | | | | | | | | | |
  |_ _  |_ _  | | | | | | | | | | | | | | | | | | | | | | |
  |_ _|_  | | | | | | | | | | | | | | | | | | | | | | | | |
  |_  | | | | | | | | | | | | | | | | | | | | | | | | | | |
  |_|_|_|_|_|_|_|_|_|_|_|_|_|_|_|_|_|_|_|_|_|_|_|_|_|_|_|_|
.
n: 1 2 3 4 5 6 7 8 9 10..12..14..16..18..20..22..24..26..28
.
It appears that the total area (also the total number of cells) in the first n set of symmetric regions of the diagram is equal to A024916(n), the sum of all divisors of all positive integers <= n.
It appears that the total area (also the total number of cells) in the n-th set of symmetric regions of the diagram is equal to sigma(n) = A000203(n) (checked by hand up n = 128).
From _Omar E. Pol_, Aug 18 2015: (Start)
The above diagram is also the top view of the stepped pyramid described in A245092 and it is also the top view of the staircase described in A244580, in both cases the figure represents the first 28 levels of the structure. Note that the diagram contains (and arises from) a hidden pattern which is shown below.
.
Illustration of initial terms as an isosceles triangle:
Row                                 _ _
1                                 _|1|1|_
2                               _|2 _|_ 2|_
3                             _|2  |1|1|  2|_
4                           _|3   _|1|1|_   3|_
5                         _|3    |2 _|_ 2|    3|_
6                       _|4     _|1|1|1|1|_     4|_
7                     _|4      |2  |1|1|  2|      4|_
8                   _|5       _|2 _|1|1|_ 2|_       5|_
9                 _|5        |2  |2 _|_ 2|  2|        5|_
10              _|6         _|2  |1|1|1|1|  2|_         6|_
11            _|6          |3   _|1|1|1|1|_   3|          6|_
12          _|7           _|2  |2  |1|1|  2|  2|_           7|_
13        _|7            |3    |2 _|1|1|_ 2|    3|            7|_
14      _|8             _|3   _|1|2 _|_ 2|1|_   3|_             8|_
15    _|8              |3    |2  |1|1|1|1|  2|    3|              8|_
16   |9                |3    |2  |1|1|1|1|  2|    3|                9|
...
This diagram is the simpler representation of the sequence.
The number of horizontal line segments in the n-th level in each side of the diagram equals A001227(n), the number of odd divisors of n.
The number of horizontal line segments in the left side of the diagram plus the number of the horizontal line segment in the right side equals A054844(n).
The total number of vertical line segments in the n-th level of the diagram equals A131507(n).
Note that this symmetric pattern also emerges from the front view of the stepped pyramid described in A245092, which is related to sigma A000203, the sum-of-divisors function, and other related sequences. The diagram represents the first 16 levels of the pyramid. (End)
		

Crossrefs

Row n has length 2*A003056(n).
Row sums give A005843, n >= 1.
Column k starts in row A008805(k-1).
Column 1 = right border = A008619, n >= 1.
Bisections are in A259176, A259177.
For further information see A262626.

Programs

  • Mathematica
    row[n_]:=Floor[(Sqrt[8n+1]-1)/2]
    s[n_,k_]:=Ceiling[(n+1)/k-(k+1)/2]-Ceiling[(n+1)/(k+1)-(k+2)/2]
    f[n_,k_]:=If[k<=row[n],s[n,k],s[n,2 row[n]+1-k]]
    TableForm[Table[f[n,k],{n,1,50},{k,1,2 row[n]}]] (* Hartmut F. W. Hoft, Apr 08 2014 *)
  • PARI
    row(n) = {my(orow = row237591(n)); vector(2*#orow, i, if (i <= #orow, orow[i], orow[2*#orow-i+1]));}
    area(n) = {my(rown = row(n)); surf = 0; h = n; odd = 1; for (i=1, #row, if (odd, surf += h*rown[i], h -= rown[i];); odd = !odd;); surf;}
    heights(v, n) = {vh = vector(n); ivh = 1; h = n; odd = 1; for (i=1, #v, if (odd, for (j=1, v[i], vh[ivh] = h; ivh++), h -= v[i];); odd = !odd;); vh;}
    isabove(hb, ha) = {for (i=1, #hb, if (hb[i] < ha[i], return (0));); return (1);}
    chkcross(nn) = {hga = concat(heights(row(1), 1), 0); for (n=2, nn, hgb = heights(row(n), n); if (! isabove(hgb, hga), print("pb cross at n=", n)); hga = concat(hgb, 0););} \\ Michel Marcus, Mar 27 2014
    
  • Python
    from sympy import sqrt
    import math
    def row(n): return int(math.floor((sqrt(8*n + 1) - 1)/2))
    def s(n, k): return int(math.ceil((n + 1)/k - (k + 1)/2)) - int(math.ceil((n + 1)/(k + 1) - (k + 2)/2))
    def T(n, k): return s(n, k) if k<=row(n) else s(n, 2*row(n) + 1 - k)
    for n in range(1, 11): print([T(n, k) for k in range(1, 2*row(n) + 1)]) # Indranil Ghosh, Apr 21 2017

Formula

Let j(n)= floor((sqrt(8n+1)-1)/2) then T(n,k) = A237591(n,k), if k <= j(n); otherwise T(n,k) = A237591(n,2*j(n)+1-k). - Hartmut F. W. Hoft, Apr 07 2014 (corrected by Omar E. Pol, May 31 2015)

Extensions

A minor edit to the definition. - N. J. A. Sloane, Jul 31 2025

A237270 Triangle read by rows in which row n lists the parts of the symmetric representation of sigma(n).

Original entry on oeis.org

1, 3, 2, 2, 7, 3, 3, 12, 4, 4, 15, 5, 3, 5, 9, 9, 6, 6, 28, 7, 7, 12, 12, 8, 8, 8, 31, 9, 9, 39, 10, 10, 42, 11, 5, 5, 11, 18, 18, 12, 12, 60, 13, 5, 13, 21, 21, 14, 6, 6, 14, 56, 15, 15, 72, 16, 16, 63, 17, 7, 7, 17, 27, 27, 18, 12, 18, 91, 19, 19, 30, 30, 20, 8, 8, 20, 90
Offset: 1

Views

Author

Omar E. Pol, Feb 19 2014

Keywords

Comments

T(n,k) is the number of cells in the k-th region of the n-th set of regions in a diagram of the symmetry of sigma(n), see example.
Row n is a palindromic composition of sigma(n).
Row sums give A000203.
Row n has length A237271(n).
In the row 2n-1 of triangle both the first term and the last term are equal to n.
If n is an odd prime then row n is [m, m], where m = (1 + n)/2.
The connection with A196020 is as follows: A196020 --> A236104 --> A235791 --> A237591 --> A237593 --> A239660 --> this sequence.
For the boundary segments in an octant see A237591.
For the boundary segments in a quadrant see A237593.
For the boundary segments in the spiral see also A239660.
For the parts in every quadrant of the spiral see A239931, A239932, A239933, A239934.
We can find the spiral on the terraces of the stepped pyramid described in A244050. - Omar E. Pol, Dec 07 2016
T(n,k) is also the area of the k-th terrace, from left to right, at the n-th level, starting from the top, of the stepped pyramid described in A245092 (see Links section). - Omar E. Pol, Aug 14 2018

Examples

			Illustration of the first 27 terms as regions (or parts) of a spiral constructed with the first 15.5 rows of A239660:
.
.                  _ _ _ _ _ _ _ _
.                 |  _ _ _ _ _ _ _|_ _ _ _ _ _ _ 7
.                 | |             |_ _ _ _ _ _ _|
.             12 _| |                           |
.               |_ _|  _ _ _ _ _ _              |_ _
.         12 _ _|     |  _ _ _ _ _|_ _ _ _ _ 5      |_
.      _ _ _| |    9 _| |         |_ _ _ _ _|         |
.     |  _ _ _|  9 _|_ _|                   |_ _ 3    |_ _ _ 7
.     | |      _ _| |      _ _ _ _          |_  |         | |
.     | |     |  _ _| 12 _|  _ _ _|_ _ _ 3    |_|_ _ 5    | |
.     | |     | |      _|   |     |_ _ _|         | |     | |
.     | |     | |     |  _ _|           |_ _ 3    | |     | |
.     | |     | |     | |    3 _ _        | |     | |     | |
.     | |     | |     | |     |  _|_ 1    | |     | |     | |
.    _|_|    _|_|    _|_|    _|_| |_|    _|_|    _|_|    _|_|    _
.   | |     | |     | |     | |         | |     | |     | |     | |
.   | |     | |     | |     |_|_ _     _| |     | |     | |     | |
.   | |     | |     | |    2  |_ _|_ _|  _|     | |     | |     | |
.   | |     | |     |_|_     2    |_ _ _|7   _ _| |     | |     | |
.   | |     | |    4    |_                 _|  _ _|     | |     | |
.   | |     |_|_ _        |_ _ _ _        |  _|    _ _ _| |     | |
.   | |    6      |_      |_ _ _ _|_ _ _ _| | 15 _|    _ _|     | |
.   |_|_ _ _        |_   4        |_ _ _ _ _|  _|     |    _ _ _| |
.  8      | |_ _      |                       |      _|   |  _ _ _|
.         |_    |     |_ _ _ _ _ _            |  _ _|28  _| |
.           |_  |_    |_ _ _ _ _ _|_ _ _ _ _ _| |      _|  _|
.          8  |_ _|  6            |_ _ _ _ _ _ _|  _ _|  _|
.                 |                               |  _ _|  31
.                 |_ _ _ _ _ _ _ _                | |
.                 |_ _ _ _ _ _ _ _|_ _ _ _ _ _ _ _| |
.                8                |_ _ _ _ _ _ _ _ _|
.
.
[For two other drawings of the spiral see the links. - _N. J. A. Sloane_, Nov 16 2020]
If the sequence does not contain negative terms then its terms can be represented in a quadrant. For the construction of the diagram we use the symmetric Dyck paths of A237593 as shown below:
---------------------------------------------------------------
Triangle         Diagram of the symmetry of sigma (n = 1..24)
---------------------------------------------------------------
.              _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
1;            |_| | | | | | | | | | | | | | | | | | | | | | | |
3;            |_ _|_| | | | | | | | | | | | | | | | | | | | | |
2, 2;         |_ _|  _|_| | | | | | | | | | | | | | | | | | | |
7;            |_ _ _|    _|_| | | | | | | | | | | | | | | | | |
3, 3;         |_ _ _|  _|  _ _|_| | | | | | | | | | | | | | | |
12;           |_ _ _ _|  _| |  _ _|_| | | | | | | | | | | | | |
4, 4;         |_ _ _ _| |_ _|_|    _ _|_| | | | | | | | | | | |
15;           |_ _ _ _ _|  _|     |  _ _ _|_| | | | | | | | | |
5, 3, 5;      |_ _ _ _ _| |      _|_| |  _ _ _|_| | | | | | | |
9, 9;         |_ _ _ _ _ _|  _ _|    _| |    _ _ _|_| | | | | |
6, 6;         |_ _ _ _ _ _| |  _|  _|  _|   |  _ _ _ _|_| | | |
28;           |_ _ _ _ _ _ _| |_ _|  _|  _ _| | |  _ _ _ _|_| |
7, 7;         |_ _ _ _ _ _ _| |  _ _|  _|    _| | |    _ _ _ _|
12, 12;       |_ _ _ _ _ _ _ _| |     |     |  _|_|   |* * * *
8, 8, 8;      |_ _ _ _ _ _ _ _| |  _ _|  _ _|_|       |* * * *
31;           |_ _ _ _ _ _ _ _ _| |  _ _|  _|      _ _|* * * *
9, 9;         |_ _ _ _ _ _ _ _ _| | |_ _ _|      _|* * * * * *
39;           |_ _ _ _ _ _ _ _ _ _| |  _ _|    _|* * * * * * *
10, 10;       |_ _ _ _ _ _ _ _ _ _| | |       |* * * * * * * *
42;           |_ _ _ _ _ _ _ _ _ _ _| |  _ _ _|* * * * * * * *
11, 5, 5, 11; |_ _ _ _ _ _ _ _ _ _ _| | |* * * * * * * * * * *
18, 18;       |_ _ _ _ _ _ _ _ _ _ _ _| |* * * * * * * * * * *
12, 12;       |_ _ _ _ _ _ _ _ _ _ _ _| |* * * * * * * * * * *
60;           |_ _ _ _ _ _ _ _ _ _ _ _ _|* * * * * * * * * * *
...
The total number of cells in the first n set of symmetric regions of the diagram equals A024916(n), the sum of all divisors of all positive integers <= n, hence the total number of cells in the n-th set of symmetric regions of the diagram equals sigma(n) = A000203(n).
For n = 9 the 9th row of A237593 is [5, 2, 2, 2, 2, 5] and the 8th row of A237593 is [5, 2, 1, 1, 2, 5] therefore between both symmetric Dyck paths there are three regions (or parts) of sizes [5, 3, 5], so row 9 is [5, 3, 5].
The sum of divisors of 9 is 1 + 3 + 9 = A000203(9) = 13. On the other hand the sum of the parts of the symmetric representation of sigma(9) is 5 + 3 + 5 = 13, equaling the sum of divisors of 9.
For n = 24 the 24th row of A237593 is [13, 4, 3, 2, 1, 1, 1, 1, 2, 3, 4, 13] and the 23rd row of A237593 is [12, 5, 2, 2, 1, 1, 1, 1, 2, 2, 5, 12] therefore between both symmetric Dyck paths there are only one region (or part) of size 60, so row 24 is 60.
The sum of divisors of 24 is 1 + 2 + 3 + 4 + 6 + 8 + 12 + 24 = A000203(24) = 60. On the other hand the sum of the parts of the symmetric representation of sigma(24) is 60, equaling the sum of divisors of 24.
Note that the number of *'s in the diagram is 24^2 - A024916(24) = 576 - 491 = A004125(24) = 85.
From _Omar E. Pol_, Nov 22 2020: (Start)
Also consider the infinite double-staircases diagram defined in A335616 (see the theorem).
For n = 15 the diagram with first 15 levels looks like this:
.
Level                         "Double-staircases" diagram
.                                          _
1                                        _|1|_
2                                      _|1 _ 1|_
3                                    _|1  |1|  1|_
4                                  _|1   _| |_   1|_
5                                _|1    |1 _ 1|    1|_
6                              _|1     _| |1| |_     1|_
7                            _|1      |1  | |  1|      1|_
8                          _|1       _|  _| |_  |_       1|_
9                        _|1        |1  |1 _ 1|  1|        1|_
10                     _|1         _|   | |1| |   |_         1|_
11                   _|1          |1   _| | | |_   1|          1|_
12                 _|1           _|   |1  | |  1|   |_           1|_
13               _|1            |1    |  _| |_  |    1|            1|_
14             _|1             _|    _| |1 _ 1| |_    |_             1|_
15            |1              |1    |1  | |1| |  1|    1|              1|
.
Starting from A196020 and after the algorithm described in A280850 and A296508 applied to the above diagram we have a new diagram as shown below:
.
Level                             "Ziggurat" diagram
.                                          _
6                                         |1|
7                            _            | |            _
8                          _|1|          _| |_          |1|_
9                        _|1  |         |1   1|         |  1|_
10                     _|1    |         |     |         |    1|_
11                   _|1      |        _|     |_        |      1|_
12                 _|1        |       |1       1|       |        1|_
13               _|1          |       |         |       |          1|_
14             _|1            |      _|    _    |_      |            1|_
15            |1              |     |1    |1|    1|     |              1|
.
The 15th row
of A249351 :  [1,1,1,1,1,1,1,1,0,0,0,1,1,1,2,1,1,1,0,0,0,1,1,1,1,1,1,1,1]
The 15th row
of triangle:  [              8,            8,            8              ]
The 15th row
of A296508:   [              8,      7,    1,    0,      8              ]
The 15th row
of A280851    [              8,      7,    1,            8              ]
.
More generally, for n >= 1, it appears there is the same correspondence between the original diagram of the symmetric representation of sigma(n) and the "Ziggurat" diagram of n.
For the definition of subparts see A239387 and also A296508, A280851. (End)
		

Crossrefs

Programs

  • Mathematica
    T[n_,k_] := Ceiling[(n + 1)/k - (k + 1)/2] (* from A235791 *)
    path[n_] := Module[{c = Floor[(Sqrt[8n + 1] - 1)/2], h, r, d, rd, k, p = {{0, n}}}, h = Map[T[n, #] - T[n, # + 1] &, Range[c]]; r = Join[h, Reverse[h]]; d = Flatten[Table[{{1, 0}, {0, -1}}, {c}], 1];
    rd = Transpose[{r, d}]; For[k = 1, k <= 2c, k++, p = Join[p, Map[Last[p] + rd[[k, 2]] * # &, Range[rd[[k, 1]]]]]]; p]
    segments[n_] := SplitBy[Map[Min, Drop[Drop[path[n], 1], -1] - path[n - 1]], # == 0 &]
    a237270[n_] := Select[Map[Apply[Plus, #] &, segments[n]], # != 0 &]
    Flatten[Map[a237270, Range[40]]] (* data *)
    (* Hartmut F. W. Hoft, Jun 23 2014 *)

Formula

T(n, k) = (A384149(n, k) + A384149(n, m+1-k))/2, where m = A237271(n) is the row length. (conjectured) - Peter Munn, Jun 01 2025

Extensions

Drawing of the spiral extended by Omar E. Pol, Nov 22 2020

A237591 Irregular triangle read by rows: T(n,k) is the difference between the total number of partitions of all positive integers <= n into exactly k consecutive parts, and the total number of partitions of all positive integers <= n into exactly k+1 consecutive parts (n>=1, 1<=k<=A003056(n)).

Original entry on oeis.org

1, 2, 2, 1, 3, 1, 3, 2, 4, 1, 1, 4, 2, 1, 5, 2, 1, 5, 2, 2, 6, 2, 1, 1, 6, 3, 1, 1, 7, 2, 2, 1, 7, 3, 2, 1, 8, 3, 1, 2, 8, 3, 2, 1, 1, 9, 3, 2, 1, 1, 9, 4, 2, 1, 1, 10, 3, 2, 2, 1, 10, 4, 2, 2, 1, 11, 4, 2, 1, 2, 11, 4, 3, 1, 1, 1, 12, 4, 2, 2, 1, 1, 12, 5, 2, 2, 1, 1, 13, 4, 3, 2, 1, 1, 13, 5, 3, 1, 2, 1, 14, 5, 2, 2, 2, 1
Offset: 1

Views

Author

Omar E. Pol, Feb 22 2014

Keywords

Comments

The original name was: Triangle read by rows: T(n,k) = A235791(n,k) - A235791(n,k+1), assuming that the virtual right border of triangle A235791 is A000004.
T(n,k) is also the length of the k-th segment in a zig-zag path on the first quadrant of the square grid, connecting the point (n, 0) with the point (m, m), starting with a segment in vertical direction, where m <= n.
Conjecture: the area of the polygon defined by the x-axis, this zig-zag path and the diagonal [(0, 0), (m, m)], is equal to A024916(n)/2, one half of the sum of all divisors of all positive integers <= n. Therefore the reflected polygon, which is adjacent to the y-axis, with the zig-zag path connecting the point (0, n) with the point (m, m), has the same property. And so on for each octant in the four quadrants.
For the representation of A024916 and A000203 we use two octants, for example: the first octant and the second octant, or the 6th octant and the 7th octant, etc., see A237593.
At least up to n = 128, two zig-zag paths never cross (checked by hand).
The finite sequence formed by the n-th row of triangle together with its mirror row gives the n-th row of triangle A237593.
The connection between A196020 and A237271 is as follows: A196020 --> A236104 --> A235791 --> this sequence --> A237593 --> A239660 --> A237270 --> A237271.
Comments from Franklin T. Adams-Watters on sequences related to the "symmetric representation of sigma" in A235791 and related sequences, Mar 31 2014. (Start)
The place to start is with A235791, which is very simple. Then go to A237591, also very simple, and A237593, still very simple.
You then need to interpret the rows of A237593 as Dyck paths. This interpretation is in terms of run lengths, so 2,1,1,2 means up twice, down once, up once, and down twice. Because the rows of A237593 are symmetric and of even length, this path will always be symmetric.
Now the surprising fact is that the areas enclosed by the Dyck path for n (laid on its side) always includes the area enclosed for n-1; and the number of squares added is sigma(n).
Finally, look at the connected areas enclosed by n but not by n-1; the size of these areas is the symmetric representation of sigma. (End)
From Hartmut F. W. Hoft, Apr 07 2014: (Start)
The row sum is A235791(n,1) - A235791(n,floor((sqrt(8n+1)-1)/2)+1) = n - 0.
Mathematica function has been written to check the conjecture as well as non-crossing zig-zag paths (Dyck paths rotated by 90 degrees) up through n=30000 (same applies to A237593). (End)
The n-th zig-zag path ending at the point (m, m), where m = A240542(n). - Omar E. Pol, Apr 16 2014
From Omar E. Pol, Aug 23 2015: (Start)
n is an odd prime if and only if T(n,2) = 1 + T(n-1,2) and T(n,k) = T(n-1,k) for the rest of the values of k.
The elements of the n-th row of triangle together with the elements of the n-th row of triangle A261350 give the n-th row of triangle A237593.
T(n,k) is also the area (or the number of cells) of the k-th vertical side at the n-th level (starting from the top) in the left hand part of the front view of the stepped pyramid described in A245092, see Example section.
(End)
From Omar E. Pol, Nov 19 2015: (Start)
T(n,k) is also the number of cells between the k-th and the (k+1)st line segments (from left to right) in the n-th row of the diagram as shown in Example section.
Note that the number of horizontal line segments in the n-th row of the diagram equals A001227(n), the number of odd divisors of n. (End)
Conjecture: the values f(n,k) in the n-th row of the triangle are either 1 or 2 for all k with ceiling((sqrt(4*n+1)-1)/2) <= k <= floor((sqrt(8*n+1)-1)/2) = r(n), the length of the n-th row, though the lower bound need not be minimal; tested through 2500000. See also A285356. - Hartmut F. W. Hoft, Apr 17 2017
Conjecture: T(n,k) is the difference between the total number of partitions of all positive integers <= n into exactly k consecutive parts, and the total number of partitions of all positive integers <= n into exactly k+1 consecutive parts. - Omar E. Pol, Apr 30 2017
From Omar E. Pol, Aug 31 2021: (Start)
It appears that T(n,2)/T(n,1) converges to 1/3.
It appears that T(n,3)/T(n,2) converges to 1/2.
It appears that T(n,4)/T(n,3) converges to 3/5.
It appears that T(n,5)/T(n,4) converges to 2/3. (End)
In other words: T(n,k) is the length of the k-th line segment of the largest Dyck path of the symmetric representation of sigma(n). - Omar E. Pol, Sep 08 2021

Examples

			Triangle begins:
   1;
   2;
   2, 1;
   3, 1;
   3, 2;
   4, 1, 1;
   4, 2, 1;
   5, 2, 1;
   5, 2, 2;
   6, 2, 1, 1;
   6, 3, 1, 1;
   7, 2, 2, 1;
   7, 3, 2, 1;
   8, 3, 1, 2;
   8, 3, 2, 1, 1;
   9, 3, 2, 1, 1;
   9, 4, 2, 1, 1;
  10, 3, 2, 2, 1;
  10, 4, 2, 2, 1;
  11, 4, 2, 1, 2;
  11, 4, 3, 1, 1, 1;
  12, 4, 2, 2, 1, 1;
  12, 5, 2, 2, 1, 1;
  13, 4, 3, 2, 1, 1;
  13, 5, 3, 1, 2, 1;
  14, 5, 2, 2, 2, 1;
  14, 5, 3, 2, 1, 2;
  15, 5, 3, 2, 1, 1, 1;
  ...
For n = 10 the 10th row of triangle A235791 is [10, 4, 2, 1] so row 10 is [6, 2, 1, 1].
From _Omar E. Pol_, Aug 23 2015: (Start)
Illustration of initial terms:
  Row                                                         _
   1                                                        _|1|
   2                                                      _|2 _|
   3                                                    _|2  |1|
   4                                                  _|3   _|1|
   5                                                _|3    |2 _|
   6                                              _|4     _|1|1|
   7                                            _|4      |2  |1|
   8                                          _|5       _|2 _|1|
   9                                        _|5        |2  |2 _|
  10                                      _|6         _|2  |1|1|
  11                                    _|6          |3   _|1|1|
  12                                  _|7           _|2  |2  |1|
  13                                _|7            |3    |2 _|1|
  14                              _|8             _|3   _|1|2 _|
  15                            _|8              |3    |2  |1|1|
  16                          _|9               _|3    |2  |1|1|
  17                        _|9                |4     _|2 _|1|1|
  18                      _|10                _|3    |2  |2  |1|
  19                    _|10                 |4      |2  |2 _|1|
  20                  _|11                  _|4     _|2  |1|2 _|
  21                _|11                   |4      |3   _|1|1|1|
  22              _|12                    _|4      |2  |2  |1|1|
  23            _|12                     |5       _|2  |2  |1|1|
  24          _|13                      _|4      |3    |2 _|1|1|
  25        _|13                       |5        |3   _|1|2  |1|
  26      _|14                        _|5       _|2  |2  |2 _|1|
  27    _|14                         |5        |3    |2  |1|2 _|
  28   |15                           |5        |3    |2  |1|1|1|
  ...
Also the diagram represents the left part of the front view of the pyramid described in A245092. For the other half front view see A261350. For more information about the pyramid and the symmetric representation of sigma see A237593. (End)
From _Omar E. Pol_, Sep 08 2021: (Start)
For n = 12 the symmetric representation of sigma(12) in the fourth quadrant is as shown below:
.                           _
                           | |
                           | |
                           | |
                           | |
                           | |
                      _ _ _| |
                    _|    _ _|
                  _|     |
                 |      _|
                 |  _ _|1
      _ _ _ _ _ _| |  2
     |_ _ _ _ _ _ _|2
            7
.
The lengths of the successive line segments from the first vertex to the central vertex of the largest Dyck path are [7, 2, 2, 1] respectively, the same as the 12th row of triangle. (End)
		

Crossrefs

Row n has length A003056(n) hence column k starts in row A000217(k).
Row sums give A000027.
Column 1 is A008619, n >= 1.
Right border gives A042974.

Programs

  • Mathematica
    row[n_]:= Floor[(Sqrt[8*n+1] -1)/2];  f[n_,k_]:= Ceiling[(n+1)/k-(k+1)/2] - Ceiling[(n+1)/(k+1)-(k+2)/2];
    Table[f[n,k],{n,1,50},{k,1,row[n]}]//Flatten
    (* Hartmut F. W. Hoft, Apr 08 2014 *)
  • PARI
    row235791(n) = vector((sqrtint(8*n+1)-1)\2, i, 1+(n-(i*(i+1)/2))\i);
    row(n) = {my(orow = concat(row235791(n), 0)); vector(#orow -1, i, orow[i] - orow[i+1]);} \\ Michel Marcus, Mar 27 2014
    
  • Python
    from sympy import sqrt
    import math
    def T(n, k): return int(math.ceil((n + 1)/k - (k + 1)/2)) - int(math.ceil((n + 1)/(k + 1) - (k + 2)/2))
    for n in range(1, 29): print([T(n, k) for k in range(1, int((sqrt(8*n + 1) - 1)/2) + 1)]) # Indranil Ghosh, Apr 30 2017

Formula

T(n,k) = ceiling((n+1)/k - (k+1)/2) - ceiling((n+1)/(k+1) - (k+2)/2), for 1 <= n and 1 <= k <= floor((sqrt(8n+1)-1)/2). - Hartmut F. W. Hoft, Apr 07 2014

Extensions

3 more rows added by Omar E. Pol, Aug 23 2015
New name from a comment dated Apr 30 2017. - Omar E. Pol, Jun 18 2023

A236104 Triangle read by rows: T(n,k), n >= 1, k >= 1, in which column k lists k copies of the positive squares in nondecreasing order, and the first element of column k is in row k(k+1)/2.

Original entry on oeis.org

1, 4, 9, 1, 16, 1, 25, 4, 36, 4, 1, 49, 9, 1, 64, 9, 1, 81, 16, 4, 100, 16, 4, 1, 121, 25, 4, 1, 144, 25, 9, 1, 169, 36, 9, 1, 196, 36, 9, 4, 225, 49, 16, 4, 1, 256, 49, 16, 4, 1, 289, 64, 16, 4, 1, 324, 64, 25, 9, 1, 361, 81, 25, 9, 1, 400, 81, 25, 9, 4
Offset: 1

Views

Author

Omar E. Pol, Jan 23 2014

Keywords

Comments

These are the squares of the entries of the triangle in A235791: T(n,k) = (A235791(n,k))^2.
Row n has length A003056(n) hence the first element of column k is in row A000217(k).
Columns 1-3 (including the initial zeros) are A000290, A008794, A211547.
Also column k lists the partial sums of the k-th column of triangle A196020 which gives an identity for sigma.
Since all the elements of this sequence are squares, we can draw an illustration of the alternating sum of row n step by step, and a symmetric diagram for A000203, A024916, A004125; see example.
For more information about the diagram see A237593.

Examples

			Triangle begins:
    1;
    4;
    9,   1;
   16,   1;
   25,   4;
   36,   4,   1;
   49,   9,   1;
   64,   9,   1;
   81,  16,   4;
  100,  16,   4,   1;
  121,  25,   4,   1;
  144,  25,   9,   1;
  169,  36,   9,   1;
  196,  36,   9,   4;
  225,  49,  16,   4,   1;
  256,  49,  16,   4,   1;
  289,  64,  16,   4,   1;
  324,  64,  25,   9,   1;
  361,  81,  25,   9,   1;
  400,  81,  25,   9,   4;
  441, 100,  36,   9,   4,   1;
  484, 100,  36,  16,   4,   1;
  529, 121,  36,  16,   4,   1;
  576, 121,  49,  16,   4,   1;
  ...
For n = 6 the sum of all divisors of all positive integers <= 6 is [1] + [1+2] + [1+3] + [1+2+4] + [1+5] + [1+2+3+6] = 1 + 3 + 4 + 7 + 6 + 12 = 33. On the other hand the 6th row of triangle is 36, 4, 1, therefore the alternating row sum is 36 - 4 + 1 = 33, equaling the sum of all divisors of all positive integers <= 6.
Illustration of the alternating sum of the 6th row as the area of a polygon (or the number of cells), step by step, in the fourth quadrant:
.     _ _ _ _ _ _       _ _ _ _ _ _       _ _ _ _ _ _
.    |           |     |           |     |           |
.    |           |     |           |     |           |
.    |           |     |           |     |           |
.    |           |     |        _ _|     |          _|
.    |           |     |       |         |        _|
.    |_ _ _ _ _ _|     |_ _ _ _|         |_ _ _ _|
.
.          36           36 - 4 = 32     36 - 4 + 1 = 33
.
Then using this method we can draw a symmetric diagram for A000203, A024916, A004125, as shown below:
--------------------------------------------------
n     A000203  A024916            Diagram
--------------------------------------------------
.                         _ _ _ _ _ _ _ _ _ _ _ _
1        1        1      |_| | | | | | | | | | | |
2        3        4      |_ _|_| | | | | | | | | |
3        4        8      |_ _|  _|_| | | | | | | |
4        7       15      |_ _ _|    _|_| | | | | |
5        6       21      |_ _ _|  _|  _ _|_| | | |
6       12       33      |_ _ _ _|  _| |  _ _|_| |
7        8       41      |_ _ _ _| |_ _|_|    _ _|
8       15       56      |_ _ _ _ _|  _|     |* *
9       13       69      |_ _ _ _ _| |      _|* *
10      18       87      |_ _ _ _ _ _|  _ _|* * *
11      12       99      |_ _ _ _ _ _| |* * * * *
12      28      127      |_ _ _ _ _ _ _|* * * * *
.
The total number of cells in the first n set of symmetric regions of the diagram equals A024916(n). It appears that the total number of cells in the n-th set of symmetric regions of the diagram equals sigma(n) = A000203(n). Example: for n = 12 the 12th row of triangle is 144, 25, 9, 1, hence the alternating sums is 144 - 25 + 9 - 1 = 127. On the other hand we have that A000290(12) - A004125(12) = 144 - 17 = A024916(12) = 127, equaling the total number of cells in the diagram after 12 stages. The number of cells in the 12th set of symmetric regions of the diagram is sigma(12) = A000203(12) = 28. Note that in this case there is only one region. Finally, the number of *'s is A004125(12) = 17.
Note that the diagram is also the top view of the stepped pyramid described in A245092. - _Omar E. Pol_, Feb 12 2018
		

Crossrefs

Programs

  • Mathematica
    Table[Ceiling[(n + 1)/k - (k + 1)/2]^2, {n, 20}, {k, Floor[(Sqrt[8 n + 1] - 1)/2]}] // Flatten (* Michael De Vlieger, Feb 10 2018, after Hartmut F. W. Hoft at A235791 *)
  • Python
    from sympy import sqrt
    import math
    def T(n, k): return int(math.ceil((n + 1)/k - (k + 1)/2))
    for n in range(1, 21): print([T(n, k)**2 for k in range(1, int(math.floor((sqrt(8*n + 1) - 1)/2)) + 1)]) # Indranil Ghosh, Apr 25 2017

Formula

Sum_{k=1..A003056(n)} (-1)^(k-1)*T(n,k) = A024916(n). [Although this was stated as a fact, as far as I can tell, no proof was known. However, Don Reble has recently found a proof, which will be added here soon. - N. J. A. Sloane, Nov 23 2020]
A000203(n) = Sum_{k=1..A003056(n)} (-1)^(k-1) * (T(n,k) - T(n-1,k)), assuming that T(k*(k+1)/2-1,k) = 0. - Omar E. Pol, Oct 10 2018

A235791 Irregular triangle read by rows: T(n,k), n >= 1, k >= 1, in which column k lists k copies of every positive integer in nondecreasing order, and the first element of column k is in row k(k+1)/2.

Original entry on oeis.org

1, 2, 3, 1, 4, 1, 5, 2, 6, 2, 1, 7, 3, 1, 8, 3, 1, 9, 4, 2, 10, 4, 2, 1, 11, 5, 2, 1, 12, 5, 3, 1, 13, 6, 3, 1, 14, 6, 3, 2, 15, 7, 4, 2, 1, 16, 7, 4, 2, 1, 17, 8, 4, 2, 1, 18, 8, 5, 3, 1, 19, 9, 5, 3, 1, 20, 9, 5, 3, 2, 21, 10, 6, 3, 2, 1, 22, 10, 6, 4, 2, 1, 23, 11, 6, 4, 2, 1, 24, 11, 7, 4, 2, 1
Offset: 1

Views

Author

Omar E. Pol, Jan 23 2014

Keywords

Comments

The alternating sum of the squares of the elements of the n-th row equals the sum of all divisors of all positive integers <= n, i.e., Sum_{k=1..A003056(n)} (-1)^(k-1)*(T(n,k))^2 = A024916(n).
Row n has length A003056(n) hence the first element of column k is in row A000217(k).
For more information see A236104.
The sum of row n gives A060831(n), the sum of the number of odd divisors of all positive integers <= n. - Omar E. Pol, Mar 01 2014. [An equivalent assertion is that the sum of row n of A237048 is the number of odd divisors of n, and this was proved by Hartmut F. W. Hoft in a comment in A237048. - N. J. A. Sloane, Dec 07 2020]
Comments from Franklin T. Adams-Watters on sequences related to the "symmetric representation of sigma" in A235791 and related sequences, Mar 31 2014: (Start)
The place to start is with A235791, which is very simple. Then go to A237591, also very simple, and A237593, still very simple.
You then need to interpret the rows of A237593 as Dyck paths. This interpretation is in terms of run lengths, so 2,1,1,2 means up twice, down once, up once, and down twice. Because the rows of A237593 are symmetric and of even length, this path will always be symmetric.
Now the surprising fact is that the areas enclosed by the Dyck path for n (laid on its side) always includes the area enclosed for n-1; and the number of squares added is sigma(n).
Finally, look at the connected areas enclosed by n but not by n-1; the size of these areas is the symmetric representation of sigma. (End)
From Hartmut F. W. Hoft, Apr 07 2014: (Start)
Mathematica function has been written to check the first property up to n = 20000.
T(n,(sqrt(8n+1)-1)/2+1) = 0 for all n >= 1, which is useful for formulas for A237591 and A237593. (End)
Alternating row sums give A240542. - Omar E. Pol, Apr 16 2014
Conjecture: T(n,k) is also the total number of partitions of all positive integers <= n into exactly k consecutive parts, i.e., the partial column sum of A285898, or in accordance with the triangles of the same family: the partial column sum of A237048. - Omar E. Pol, Apr 28 2017, Nov 24 2020
The above conjecture is true. The proof will be added soon (it uses the generating function for the columns). - N. J. A. Sloane, Nov 24 2020
T(n,k) is also the total length of all line segments between the k-th vertex and the central vertex of the largest Dyck path of the symmetric representation of sigma(n). In other words: T(n,k) is the sum of the last (A003056(n)-k+1) terms of the n-th row of A237591. - Omar E. Pol, Sep 07 2021
T(n,k) is also the Manhattan distance between the k-th vertex and the central vertex of the Dyck path described in the n-th row of the triangle A237593. - Omar E. Pol, Jan 11 2023

Examples

			Triangle begins:
   1;
   2;
   3,  1;
   4,  1;
   5,  2;
   6,  2,  1;
   7,  3,  1;
   8,  3,  1;
   9,  4,  2;
  10,  4,  2,  1;
  11,  5,  2,  1;
  12,  5,  3,  1;
  13,  6,  3,  1;
  14,  6,  3,  2;
  15,  7,  4,  2,  1;
  16,  7,  4,  2,  1;
  17,  8,  4,  2,  1;
  18,  8,  5,  3,  1;
  19,  9,  5,  3,  1;
  20,  9,  5,  3,  2;
  21, 10,  6,  3,  2,  1;
  22, 10,  6,  4,  2,  1;
  23, 11,  6,  4,  2,  1;
  24, 11,  7,  4,  2,  1;
  25, 12,  7,  4,  3,  1;
  26, 12,  7,  5,  3,  1;
  27, 13,  8,  5,  3,  2;
  28, 13,  8,  5,  3,  2,  1;
  ...
For n = 10 the 10th row of triangle is 10, 4, 2, 1, so we have that 10^2 - 4^2 + 2^2 - 1^2 = 100 - 16 + 4 - 1 = 87, the same as A024916(10) = 87, the sum of all divisors of all positive integers <= 10.
From _Omar E. Pol_, Nov 19 2015: (Start)
Illustration of initial terms in the third quadrant:
.                                                            y
Row                                                         _|
1                                                         _|1|
2                                                       _|2 _|
3                                                     _|3  |1|
4                                                   _|4   _|1|
5                                                 _|5    |2 _|
6                                               _|6     _|2|1|
7                                             _|7      |3  |1|
8                                           _|8       _|3 _|1|
9                                         _|9        |4  |2 _|
10                                      _|10        _|4  |2|1|
11                                    _|11         |5   _|2|1|
12                                  _|12          _|5  |3  |1|
13                                _|13           |6    |3 _|1|
14                              _|14            _|6   _|3|2 _|
15                            _|15             |7    |4  |2|1|
16                          _|16              _|7    |4  |2|1|
17                        _|17               |8     _|4 _|2|1|
18                      _|18                _|8    |5  |3  |1|
19                    _|19                 |9      |5  |3 _|1|
20                  _|20                  _|9     _|5  |3|2 _|
21                _|21                   |10     |6   _|3|2|1|
22              _|22                    _|10     |6  |4  |2|1|
23            _|23                     |11      _|6  |4  |2|1|
24          _|24                      _|11     |7    |4 _|2|1|
25        _|25                       |12       |7   _|4|3  |1|
26      _|26                        _|12      _|7  |5  |3 _|1|
27    _|27                         |13       |8    |5  |3|2 _|
28   |28                           |13       |8    |5  |3|2|1|
...
T(n,k) is also the number of cells between the k-th vertical line segment (from left to right) and the y-axis in the n-th row of the structure.
Note that the number of horizontal line segments in the n-th row of the structure equals A001227(n), the number of odd divisors of n.
Also the diagram represents the left part of the front view of the pyramid described in A245092. (End)
For more information about the diagram see A286001. - _Omar E. Pol_, Dec 19 2020
From _Omar E. Pol_, Sep 08 2021: (Start)
For n = 12 the symmetric representation of sigma(12) in the fourth quadrant is as shown below:
                            _
                           | |
                           | |
                           | |
                           | |
                           | |
                      _ _ _| |
                    _|    _ _|
                  _|     |
                 |      _|
                 |  _ _|
      _ _ _ _ _ _| |3   1
     |_ _ _ _ _ _ _|
    12              5
.
For n = 12 and k = 1 the total length of all line segments between the first vertex and the central vertex of the largest Dyck path is equal to 12, so T(12,1) = 12.
For n = 12 and k = 2 the total length of all line segments between the second vertex and the central vertex of the largest Dyck path is equal to 5, so T(12,2) = 5.
For n = 12 and k = 3 the total length of all line segments between the third vertex and the central vertex of the largest Dyck path is equal to 3, so T(12,3) = 3.
For n = 12 and k = 4 the total length of all line segments between the fourth vertex and the central vertex of the largest Dyck path is equal to 1, so T(12,4) = 1.
Hence the 12th row of triangle is [12, 5, 3, 1]. (End)
		

Crossrefs

Columns 1..3: A000027, A008619, A008620.
Operations on rows: A003056 (number of terms), A237591 (differences between terms), A060831 (sums), A339577 (products), A240542 (alternating sums), A236104 (squares), A339576 (sums of squares), A024916 (alternating sums of squares), A237048 (differences between rows), A042974 (right border).

Programs

  • Mathematica
    row[n_] := Floor[(Sqrt[8*n + 1] - 1)/2]; f[n_, k_] := Ceiling[(n + 1)/k - (k + 1)/2]; Table[f[n, k], {n, 1, 150}, {k, 1, row[n]}] // Flatten (* Hartmut F. W. Hoft, Apr 07 2014 *)
  • PARI
    row(n) = vector((sqrtint(8*n+1)-1)\2, i, 1+(n-(i*(i+1)/2))\i); \\ Michel Marcus, Mar 27 2014
    
  • Python
    from sympy import sqrt
    import math
    def T(n, k): return int(math.ceil((n + 1)/k - (k + 1)/2))
    for n in range(1, 21): print([T(n, k) for k in range(1, int(math.floor((sqrt(8*n + 1) - 1)/2)) + 1)]) # Indranil Ghosh, Apr 25 2017

Formula

T(n,k) = ceiling((n+1)/k - (k+1)/2) for 1 <= n, 1 <= k <= floor((sqrt(8n+1)-1)/2) = A003056(n). - Hartmut F. W. Hoft, Apr 07 2014
G.f. for column k (k >= 1): x^(k*(k+1)/2)/( (1-x)*(1-x^k) ). - N. J. A. Sloane, Nov 24 2020
T(n,k) = Sum_{j=1..n} A237048(j,k). - Omar E. Pol, May 18 2017
T(n,k) = sqrt(A236104(n,k)). - Omar E. Pol, Feb 14 2018
Sigma(n) = Sum_{k=1..A003056(n)} (-1)^(k-1) * (T(n,k)^2 - T(n-1,k)^2), assuming that T(k*(k+1)/2-1,k) = 0. - Omar E. Pol, Oct 10 2018
a(s(n,k)) = T(n,k), n >= 1, 1 <= k <= r = floor((sqrt(8*n + 1) - 1)/2), where s(n,k) = r*n - r*(r+1)*(r+2)/6 + k translates position (row n, column k) in the triangle of this sequence to its position in the sequence. - Hartmut F. W. Hoft, Feb 24 2021

A237271 Number of parts in the symmetric representation of sigma(n).

Original entry on oeis.org

1, 1, 2, 1, 2, 1, 2, 1, 3, 2, 2, 1, 2, 2, 3, 1, 2, 1, 2, 1, 4, 2, 2, 1, 3, 2, 4, 1, 2, 1, 2, 1, 4, 2, 3, 1, 2, 2, 4, 1, 2, 1, 2, 2, 3, 2, 2, 1, 3, 3, 4, 2, 2, 1, 4, 1, 4, 2, 2, 1, 2, 2, 5, 1, 4, 1, 2, 2, 4, 3, 2, 1, 2, 2, 4, 2, 3, 2, 2, 1, 5, 2, 2, 1, 4, 2, 4, 1, 2, 1
Offset: 1

Views

Author

Omar E. Pol, Feb 25 2014

Keywords

Comments

The diagram of the symmetry of sigma has been via A196020 --> A236104 --> A235791 --> A237591 --> A237593.
For more information see A237270.
a(n) is also the number of terraces at n-th level (starting from the top) of the stepped pyramid described in A245092. - Omar E. Pol, Apr 20 2016
a(n) is also the number of subparts in the first layer of the symmetric representation of sigma(n). For the definion of "subpart" see A279387. - Omar E. Pol, Dec 08 2016
Note that the number of subparts in the symmetric representation of sigma(n) equals A001227(n), the number of odd divisors of n. (See the second example). - Omar E. Pol, Dec 20 2016
From Hartmut F. W. Hoft, Dec 26 2016: (Start)
Using odd prime number 3, observe that the 1's in the 3^k-th row of the irregular triangle of A237048 are at index positions
3^0 < 2*3^0 < 3^1 < 2*3^1 < ... < 2*3^((k-1)/2) < 3^(k/2) < ...
the last being 2*3^((k-1)/2) when k is odd and 3^(k/2) when k is even. Since odd and even index positions alternate, each pair (3^i, 2*3^i) specifies one part in the symmetric representation with a center part present when k is even. A straightforward count establishes that the symmetric representation of 3^k, k>=0, has k+1 parts. Since this argument is valid for any odd prime, every positive integer occurs infinitely many times in the sequence. (End)
a(n) = number of runs of consecutive nonzero terms in row n of A262045. - N. J. A. Sloane, Jan 18 2021
Indices of odd terms give A071562. Indices of even terms give A071561. - Omar E. Pol, Feb 01 2021
a(n) is also the number of prisms in the three-dimensional version of the symmetric representation of k*sigma(n) where k is the height of the prisms, with k >= 1. - Omar E. Pol, Jul 01 2021
With a(1) = 0; a(n) is also the number of parts in the symmetric representation of A001065(n), the sum of aliquot parts of n. - Omar E. Pol, Aug 04 2021
The parity of this sequence is also the characteristic function of numbers that have middle divisors. - Omar E. Pol, Sep 30 2021
a(n) is also the number of polycubes in the 3D-version of the ziggurat of order n described in A347186. - Omar E. Pol, Jun 11 2024
Conjecture 1: a(n) is the number of odd divisors of n except the "e" odd divisors described in A005279. Thus a(n) is the length of the n-th row of A379288. - Omar E. Pol, Dec 21 2024
The conjecture 1 was checked up n = 10000 by Amiram Eldar. - Omar E. Pol, Dec 22 2024
The conjecture 1 is true. For a proof see A379288. - Hartmut F. W. Hoft, Jan 21 2025
From Omar E. Pol, Jul 31 2025: (Start)
Conjecture 2: a(n) is the number of 2-dense sublists of divisors of n.
We call "2-dense sublists of divisors of n" to the maximal sublists of divisors of n whose terms increase by a factor of at most 2.
In a 2-dense sublist of divisors of n the terms are in increasing order and two adjacent terms are the same two adjacent terms in the list of divisors of n.
Example: for n = 10 the list of divisors of 10 is [1, 2, 5, 10]. There are two 2-dense sublists of divisors of 10, they are [1, 2], [5, 10], so a(10) = 2.
The conjecture 2 is essentially the same as the second conjecture in the Comments of A384149. See also Peter Munn's formula in A237270.
The indices where a(n) = 1 give A174973 (2-dense numbers). See the proof there. (End)
Conjecture 3: a(n) is the number of divisors p of n such that p is greater than twice the adjacent previous divisor of n. The divisors p give the n-th row of A379288. - Omar E. Pol, Aug 02 2025

Examples

			Illustration of initial terms (n = 1..12):
---------------------------------------------------------
n   A000203  A237270    a(n)            Diagram
---------------------------------------------------------
.                               _ _ _ _ _ _ _ _ _ _ _ _
1       1      1         1     |_| | | | | | | | | | | |
2       3      3         1     |_ _|_| | | | | | | | | |
3       4      2+2       2     |_ _|  _|_| | | | | | | |
4       7      7         1     |_ _ _|    _|_| | | | | |
5       6      3+3       2     |_ _ _|  _|  _ _|_| | | |
6      12      12        1     |_ _ _ _|  _| |  _ _|_| |
7       8      4+4       2     |_ _ _ _| |_ _|_|    _ _|
8      15      15        1     |_ _ _ _ _|  _|     |
9      13      5+3+5     3     |_ _ _ _ _| |      _|
10     18      9+9       2     |_ _ _ _ _ _|  _ _|
11     12      6+6       2     |_ _ _ _ _ _| |
12     28      28        1     |_ _ _ _ _ _ _|
...
For n = 9 the sum of divisors of 9 is 1+3+9 = A000203(9) = 13. On the other hand the 9th set of symmetric regions of the diagram is formed by three regions (or parts) with 5, 3 and 5 cells, so the total number of cells is 5+3+5 = 13, equaling the sum of divisors of 9. There are three parts: [5, 3, 5], so a(9) = 3.
From _Omar E. Pol_, Dec 21 2016: (Start)
Illustration of the diagram of subparts (n = 1..12):
---------------------------------------------------------
n   A000203  A279391  A001227           Diagram
---------------------------------------------------------
.                               _ _ _ _ _ _ _ _ _ _ _ _
1       1      1         1     |_| | | | | | | | | | | |
2       3      3         1     |_ _|_| | | | | | | | | |
3       4      2+2       2     |_ _|  _|_| | | | | | | |
4       7      7         1     |_ _ _|  _ _|_| | | | | |
5       6      3+3       2     |_ _ _| |_|  _ _|_| | | |
6      12      11+1      2     |_ _ _ _|  _| |  _ _|_| |
7       8      4+4       2     |_ _ _ _| |_ _|_|  _ _ _|
8      15      15        1     |_ _ _ _ _|  _|  _| |
9      13      5+3+5     3     |_ _ _ _ _| |  _|  _|
10     18      9+9       2     |_ _ _ _ _ _| |_ _|
11     12      6+6       2     |_ _ _ _ _ _| |
12     28      23+5      2     |_ _ _ _ _ _ _|
...
For n = 6 the symmetric representation of sigma(6) has two subparts: [11, 1], so A000203(6) = 12 and A001227(6) = 2.
For n = 12 the symmetric representation of sigma(12) has two subparts: [23, 5], so A000203(12) = 28 and A001227(12) = 2. (End)
From _Hartmut F. W. Hoft_, Dec 26 2016: (Start)
Two examples of the general argument in the Comments section:
Rows 27 in A237048 and A249223 (4 parts)
i:  1  2 3 4 5 6 7 8 9 . . 12
27: 1  1 1 0 0 1                           1's in A237048 for odd divisors
    1 27 3     9                           odd divisors represented
27: 1  0 1 1 1 0 0 1 1 1 0 1               blocks forming parts in A249223
Rows 81 in A237048 and A249223 (5 parts)
i:  1  2 3 4 5 6 7 8 9 . . 12. . . 16. . . 20. . . 24
81: 1  1 1 0 0 1 0 0 1 0 0 0                          1's in A237048 f.o.d
    1 81 3    27     9                                odd div. represented
81: 1  0 1 1 1 0 0 0 1 1 1 1 1 1 1 1 0 0 0 1 1 1 0 1  blocks fp in A249223
(End)
		

Crossrefs

Programs

  • Mathematica
    a237271[n_] := Length[a237270[n]] (* code defined in A237270 *)
    Map[a237271, Range[90]] (* data *)
    (* Hartmut F. W. Hoft, Jun 23 2014 *)
    a[n_] := Module[{d = Partition[Divisors[n], 2, 1]}, 1 + Count[d, ?(OddQ[#[[2]]] && #[[2]] >= 2*#[[1]] &)]]; Array[a, 100] (* _Amiram Eldar,  Dec 22 2024 *)
  • PARI
    fill(vcells, hga, hgb) = {ic = 1; for (i=1, #hgb, if (hga[i] < hgb[i], for (j=hga[i], hgb[i]-1, cell = vector(4); cell[1] = i - 1; cell[2] = j; vcells[ic] = cell; ic ++;););); vcells;}
    findfree(vcells) = {for (i=1, #vcells, vcelli = vcells[i]; if ((vcelli[3] == 0) && (vcelli[4] == 0), return (i));); return (0);}
    findxy(vcells, x, y) = {for (i=1, #vcells, vcelli = vcells[i]; if ((vcelli[1]==x) && (vcelli[2]==y) && (vcelli[3] == 0) && (vcelli[4] == 0), return (i));); return (0);}
    findtodo(vcells, iz) = {for (i=1, #vcells, vcelli = vcells[i]; if ((vcelli[3] == iz) && (vcelli[4] == 0), return (i)); ); return (0);}
    zcount(vcells) = {nbz = 0; for (i=1, #vcells, nbz = max(nbz, vcells[i][3]);); nbz;}
    docell(vcells, ic, iz) = {x = vcells[ic][1]; y = vcells[ic][2]; if (icdo = findxy(vcells, x-1, y), vcells[icdo][3] = iz); if (icdo = findxy(vcells, x+1, y), vcells[icdo][3] = iz); if (icdo = findxy(vcells, x, y-1), vcells[icdo][3] = iz); if (icdo = findxy(vcells, x, y+1), vcells[icdo][3] = iz); vcells[ic][4] = 1; vcells;}
    docells(vcells, ic, iz) = {vcells[ic][3] = iz; while (ic, vcells = docell(vcells, ic, iz); ic = findtodo(vcells, iz);); vcells;}
    nbzb(n, hga, hgb) = {vcells = vector(sigma(n)); vcells = fill(vcells, hga, hgb); iz = 1; while (ic = findfree(vcells), vcells = docells(vcells, ic, iz); iz++;); zcount(vcells);}
    lista(nn) = {hga = concat(heights(row237593(0), 0), 0); for (n=1, nn, hgb = heights(row237593(n), n); nbz = nbzb(n, hga, hgb); print1(nbz, ", "); hga = concat(hgb, 0););} \\ with heights() also defined in A237593; \\ Michel Marcus, Mar 28 2014
    
  • Python
    from sympy import divisors
    def a(n: int) -> int:
        divs = list(divisors(n))
        d = [divs[i:i+2] for i in range(len(divs) - 1)]
        s = sum(1 for pair in d if len(pair) == 2 and pair[1] % 2 == 1 and pair[1] >= 2 * pair[0])
        return s + 1
    print([a(n) for n in range(1, 80)])  # Peter Luschny, Aug 05 2025

Formula

a(n) = A001227(n) - A239657(n). - Omar E. Pol, Mar 23 2014
a(p^k) = k + 1, where p is an odd prime and k >= 0. - Hartmut F. W. Hoft, Dec 26 2016
Theorem: a(n) <= number of odd divisors of n (cf. A001227). The differences are in A239657. - N. J. A. Sloane, Jan 19 2021
a(n) = A340846(n) - A340833(n) + 1 (Euler's formula). - Omar E. Pol, Feb 01 2021
a(n) = A000005(n) - A243982(n). - Omar E. Pol, Aug 02 2025
Previous Showing 11-20 of 228 results. Next