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.

A329440 Triangle read by rows: n-th row gives positions of ones in A329126(n) in decreasing order.

Original entry on oeis.org

0, 2, 1, 5, 3, 1, 5, 4, 3, 2, 17, 13, 9, 5, 1, 6, 5, 4, 3, 2, 1, 37, 31, 25, 19, 13, 7, 1, 10, 9, 8, 7, 6, 5, 4, 3, 18, 16, 14, 12, 10, 8, 6, 4, 2, 18, 17, 14, 13, 10, 9, 6, 5, 2, 1, 101, 91, 81, 71, 61, 51, 41, 31, 21, 11, 1, 13, 12, 11, 10, 9, 8, 7, 6, 5, 4
Offset: 1

Views

Author

Peter Kagey, Nov 13 2019

Keywords

Comments

Does the n-th row always contain n entries?
Do the rows always form an n term arithmetic progression?
Conjecture: the last value in each row is A051903(n).

Examples

			Table begins:
   0
   2,  1
   5,  3,  1
   5,  4,  3,  2
  17, 13,  9,  5,  1
   6,  5,  4,  3,  2, 1
  37, 31, 25, 19, 13, 7, 1
For example, when n = 5, x^17 + x^13 + x^9 + x^5 + x is a multiple of 5 for all integers x > 1.
		

Crossrefs