cp's OEIS Frontend

T(n,k) = A003991(n-1,k) for 1 <= k < n;

T(n,k) = T(n,n-1-k) for k < n;

T(n,1) = n-1; T(n,n) = 0; T(n,2) = A005843(n-2) for n > 1;

T(n,3) = A008585(n-3) for n>2; T(n,4) = A008586(n-4) for n > 3;

T(n,5) = A008587(n-5) for n>4; T(n,6) = A008588(n-6) for n > 5;

T(n,7) = A008589(n-7) for n>6; T(n,8) = A008590(n-8) for n > 7;

T(n,9) = A008591(n-9) for n>8; T(n,10) = A008592(n-10) for n > 9;

T(n,11) = A008593(n-11) for n>10; T(n,12) = A008594(n-12) for n > 11;

T(n,13) = A008595(n-13) for n>12; T(n,14) = A008596(n-14) for n > 13;

T(n,15) = A008597(n-15) for n>14; T(n,16) = A008598(n-16) for n > 15;

T(n,17) = A008599(n-17) for n>16; T(n,18) = A008600(n-18) for n > 17;

T(n,19) = A008601(n-19) for n>18; T(n,20) = A008602(n-20) for n > 19;

Row sums give A000292; triangle sums give A000332;

All numbers m > 0 occur A000005(m) times;

A002378(n) = T(A005408(n),n+1) = n*(n+1).

k-th columns are arithmetic progressions with step k, starting with 0. If a zero is prefixed to the sequence, then we get a new table where the columns are again arithmetic progressions with step k, but starting with k, k=0,1,2,...: 1st column = (0,0,0,...), 2nd column = (1,2,3,...), 3rd column = (2,4,6,8,...), etc. - M. F. Hasler, Feb 02 2013

Construct the infinite-dimensional matrix representation of angular momentum operators (J_1,J_2,J_3) in the Jordan-Schwinger form (cf. Harter, Klee, Schwinger). The triangle terms T(n,k) = T(2j,j+m) satisfy: (1/2)T(2j,j+m)^(1/2) = = = i = -i . Matrices for J_1 and J_2 are sparse. These equalities determine the only nonzero entries. - Bradley Klee, Jan 29 2016

T(n+1,k+1) is the number of degrees of freedom of a k-dimensional affine subspace within an n-dimensional vector space. This is most readily interpreted geometrically: e.g. in 3 dimensions a line (1-dimensional subspace) has T(4,2) = 4 degrees of freedom and a plane has T(4,3) = 3. T(n+1,1) = n indicates that points in n dimensions have n degrees of freedom. T(n,n) = 0 for any n as all n-dimensional spaces in an n-dimensional space are equivalent. - Daniel Leary, Apr 29 2020

Define the digital mean of n in base b, dm(b, n), to be (Sum_{i=1..d} 2*d_i - (b-1)) / (2*d), where d is the number of digits in the base b representation of n and d_i the individual digits.

a(n) is the subset of multiples of nine for which dm(10, n) = 0; that is, two times the sum of the digits is equal to nine times the number of digits.

Subset of A031443.

These numbers have digital mean dm(b, n) = (Sum_{i=1..d} 2*d_i - (b-1)) / (2*d) = 0, where d is the number of digits in the base b representation of n and d_i the individual digits, for 2 <= b <= 3.

Intersection of A008591 and A000041.

Equivalently, numbers congruent to 0 or 8 mod 9.

Terms of A007494 with indices in A047264. Also, terms of A060464 with indices in A047335.

This is a subsequence of A373475, containing all its terms that are not multiples of 3. (See comments in A373475 for a proof). The first difference from A373475 is at n=4186, where A373475(4186) = 19683 = 3^9, the value which is missing from this sequence. - Antti Karttunen, Jun 07 2024

From Antti Karttunen, Jun 11 2024: (Start)

A multiplicative semigroup: if m and n are in the sequence, then so is m*n.

Numbers that are not multiples of 3, and the multiplicities of prime factors of the forms 3m+1 (A002476) and 3m-1 (A003627) are equal modulo 3.

Like A373597, which is a subsequence, also this sequence can be viewed as a kind of k=3 variant of A046337.

A289142, numbers whose sum of prime factors (with multiplicity, A001414) is a multiple of 3, is generated (as a multiplicative semigroup) by the union of this sequence with {3}.

A327863, numbers whose arithmetic derivative is a multiple of 3, is generated by this sequence and A008591.

A373478, numbers that are in the intersection of A289142 and A327863, is generated by the union of this sequence with {9, 27}.

A373475, numbers that are in the intersection of A289142 and A369644 (positions of multiples of 3 in A083345), is generated by the union of this sequence with {19683}, where 19683 = 3^9.

(End)

The integers in the multiplicative subgroup of positive rationals generated by semiprimes of the form 3m+2 (A344872) and cubes of primes except 27. - Peter Munn, Jun 19 2024

Equivalently, multiples of 9 with the largest prime divisor < 10.

Subset of A031443 and A144798.

These numbers have digital mean dm(b, n) = (Sum_{i=1..d} 2*d_i - (b-1)) / (2*d) = 0, where d is the number of digits in the base b representation of n and d_i the individual digits, for 2 <= b <= 4.