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.

Showing 1-4 of 4 results.

A329332 Table of powers of squarefree numbers, powers of A019565(n) in increasing order in row n. Square array A(n,k) n >= 0, k >= 0 read by descending antidiagonals.

Original entry on oeis.org

1, 1, 1, 1, 2, 1, 1, 4, 3, 1, 1, 8, 9, 6, 1, 1, 16, 27, 36, 5, 1, 1, 32, 81, 216, 25, 10, 1, 1, 64, 243, 1296, 125, 100, 15, 1, 1, 128, 729, 7776, 625, 1000, 225, 30, 1, 1, 256, 2187, 46656, 3125, 10000, 3375, 900, 7, 1, 1, 512, 6561, 279936, 15625, 100000, 50625, 27000, 49, 14
Offset: 0

Views

Author

Peter Munn, Nov 10 2019

Keywords

Comments

The A019565 row order gives the table neat relationships with A003961, A003987, A059897, A225546, A319075 and A329050. See the formula section.
Transposition of this table, that is reflection about its main diagonal, has subtle symmetries. For example, consider the unique factorization of a number into powers of distinct primes. This can be restated as factorization into numbers from rows 2^n (n >= 0) with no more than one from each row. Reflecting about the main diagonal, this factorization becomes factorization (of a related number) into numbers from columns 2^k (k >= 0) with no more than one from each column. This is also unique and is factorization into powers of squarefree numbers with distinct exponents that are powers of two. See the example section.

Examples

			Square array A(n,k) begins:
n\k |  0   1     2      3        4          5           6             7
----+------------------------------------------------------------------
   0|  1   1     1      1        1          1           1             1
   1|  1   2     4      8       16         32          64           128
   2|  1   3     9     27       81        243         729          2187
   3|  1   6    36    216     1296       7776       46656        279936
   4|  1   5    25    125      625       3125       15625         78125
   5|  1  10   100   1000    10000     100000     1000000      10000000
   6|  1  15   225   3375    50625     759375    11390625     170859375
   7|  1  30   900  27000   810000   24300000   729000000   21870000000
   8|  1   7    49    343     2401      16807      117649        823543
   9|  1  14   196   2744    38416     537824     7529536     105413504
  10|  1  21   441   9261   194481    4084101    85766121    1801088541
  11|  1  42  1764  74088  3111696  130691232  5489031744  230539333248
  12|  1  35  1225  42875  1500625   52521875  1838265625   64339296875
Reflection of factorization about the main diagonal: (Start)
The canonical (prime power) factorization of 864 is 2^5 * 3^3 = 32 * 27. Reflecting the factors about the main diagonal of the table gives us 10 * 36 = 10^1 * 6^2 = 360. This is the unique factorization of 360 into powers of squarefree numbers with distinct exponents that are powers of two.
Reflection about the main diagonal is given by the self-inverse function A225546(.). Clearly, all positive integers are in the domain of A225546, whether or not they appear in the table. It is valid to start from 360, observe that A225546(360) = 864, then use 864 to derive 360's factorization into appropriate powers of squarefree numbers as above.
(End)
		

Crossrefs

The range of values is A072774.
Rows (abbreviated list): A000079(1), A000244(2), A000400(3), A000351(4), A011557(5), A001024(6), A009974(7), A000420(8), A001023(9), A009965(10), A001020(16), A001022(32), A001026(64).
A019565 is column 1, A334110 is column 2, and columns that are sorted in increasing order (some without the 1) are: A005117(1), A062503(2), A062838(3), A113849(4), A113850(5), A113851(6), A113852(7).
Other subtables: A182944, A319075, A329050.
Re-ordered subtable of A297845, A306697, A329329.
A000290, A003961, A003987, A059897 and A225546 are used to express relationships between terms of this sequence.
Cf. A285322.

Formula

A(n,k) = A019565(n)^k.
A(k,n) = A225546(A(n,k)).
A(n,2k) = A000290(A(n,k)) = A(n,k)^2.
A(2n,k) = A003961(A(n,k)).
A(n,2k+1) = A(n,2k) * A(n,1).
A(2n+1,k) = A(2n,k) * A(1,k).
A(A003987(n,m), k) = A059897(A(n,k), A(m,k)).
A(n, A003987(m,k)) = A059897(A(n,m), A(n,k)).
A(2^n,k) = A319075(k,n+1).
A(2^n, 2^k) = A329050(n,k).
A(n,k) = A297845(A(n,1), A(1,k)) = A306697(A(n,1), A(1,k)), = A329329(A(n,1), A(1,k)).
Sum_{n>=0} 1/A(n,k) = zeta(k)/zeta(2*k), for k >= 2. - Amiram Eldar, Dec 03 2022

A218733 a(n) = (30^n - 1)/29.

Original entry on oeis.org

0, 1, 31, 931, 27931, 837931, 25137931, 754137931, 22624137931, 678724137931, 20361724137931, 610851724137931, 18325551724137931, 549766551724137931, 16492996551724137931, 494789896551724137931, 14843696896551724137931, 445310906896551724137931, 13359327206896551724137931
Offset: 0

Views

Author

M. F. Hasler, Nov 04 2012

Keywords

Comments

Partial sums of powers of 30 (A009974).

Crossrefs

Programs

Formula

a(n) = floor(30^n/29).
From Vincenzo Librandi, Nov 07 2012: (Start)
G.f.: x/((1-x)*(1-30*x)).
a(n) = 31*a(n-1) - 30*a(n-2). (End)
E.g.f.: exp(x)*(exp(29*x) - 1)/29. - Elmo R. Oliveira, Aug 29 2024

A100401 Digital root of 3^n.

Original entry on oeis.org

1, 3, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9
Offset: 0

Views

Author

Cino Hilliard, Dec 30 2004

Keywords

Comments

This sequence also gives the digital root of 12^n, 21^n, 30^n, 39^n, 48^n, 57^n, ... (any k^n where k is congruent to 3 mod 9). - Timothy L. Tiffin, Dec 02 2023

Examples

			For n=14, the digits of 3^14 = 4782969 sum to 45, whose digits sum to 9. So, a(14) = 9.
		

Crossrefs

Programs

Formula

a(n) = 3^n mod 18. - Zerinvary Lajos, Nov 25 2009
From Timothy L. Tiffin, Nov 30 2023: (Start)
a(n) = 9 for n >= 2.
G.f.: (1+2x+6x^2)/(1-x).
a(n) = A100403(n) for n <> 1. (End)
a(n) = A010888(A000244(n)). - Michel Marcus, Dec 01 2023
a(n) = A010888(A001021(n)) = A010888(A009965(n)) = A010888(A009974(n)) = A010888(A009983(n)) = A010888(A009992(n)) = A010888(A225374(n)). - Timothy L. Tiffin, Dec 02 2023
E.g.f.: 9*exp(x) - 6*x - 8. - Elmo R. Oliveira, Aug 08 2024
a(n) = A007953(3*a(n-1)) = A010888(3*a(n-1)). - Stefano Spezia, Mar 20 2025

A165851 Totally multiplicative sequence with a(p) = 30.

Original entry on oeis.org

1, 30, 30, 900, 30, 900, 30, 27000, 900, 900, 30, 27000, 30, 900, 900, 810000, 30, 27000, 30, 27000, 900, 900, 30, 810000, 900, 900, 27000, 27000, 30, 27000, 30, 24300000, 900, 900, 900, 810000, 30, 900, 900, 810000, 30, 27000, 30, 27000, 27000
Offset: 1

Views

Author

Jaroslav Krizek, Sep 28 2009

Keywords

Crossrefs

Programs

  • Magma
    [n eq 1 select 1 else 30^(&+[p[2]: p in Factorization(n)]): n in [1..120]]; // Vincenzo Librandi, Apr 14 2016
  • Mathematica
    30^PrimeOmega[Range[50]] (* Harvey P. Dale, May 04 2015 *)
  • PARI
    a(n) = 30^bigomega(n); \\ Michel Marcus, Apr 14 2016
    

Formula

a(n) = A009974(A001222(n)) = 30^bigomega(n) = 30^A001222(n).
Showing 1-4 of 4 results.