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.

A335082 First elements of maximal isospectral chains of length 3.

Original entry on oeis.org

10980, 35280, 36180, 43380, 46980, 47268, 52164, 59508, 71604, 73476, 75780, 87444, 92880, 94500, 100980, 101700, 108180, 122580, 132480, 139284, 150948, 151956, 172980, 176580, 179172, 198576, 201168, 202464, 215424, 235188, 237384, 237780, 241380, 245556
Offset: 1

Views

Author

Walter Kehowski, May 24 2020

Keywords

Comments

Isospectral Chain Conjecture: There exist isospectral chains of any positive length.
A number N is the first element of a maximal isospectral chain of length n if it is not part of an isospectral chain of length greater than n.
Two integers are isospectral if they have the same spectral basis. An isospectral chain of length n is a sequence N1,...,Nn of integers with the same spectral basis such that N1=2*N2=...=n*Nn and index(Nk)=k. A chain is maximal if it cannot be extended to an isospectral chain of length n+1.
The spectral sum of an integer N with at least two prime factors is the sum of the elements of its spectral basis, and is of the form k*N+1, where k is a positive integer. Then we say that N has index k, index(N)=k.

Examples

			a(1) = 10980 since the three numbers 10980, 10980/2 = 5490, and 10980/3 = 3660 all have spectral basis {2745, 2440, 2196, 3600}, while index(10980) = 1, index(5490) = 2, and index(3660) = 3.
		

Crossrefs