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.

A241915 After a(1)=1, numbers 1 .. A061395(n), followed by numbers 1 .. A061395(n+1), etc.

Original entry on oeis.org

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

Views

Author

Antti Karttunen, May 01 2014

Keywords

Examples

			Viewed as an irregular table, the sequence is constructed as:
"Row"
  [1] 1; (by convention, a(1)=1)
  [2] 1; (because A061395(2)=1 (the index of the largest prime factor), we have here terms from 1 to 1)
  [3] 1, 2; (because A061395(3)=2, we have terms from 1 to 2)
  [4] 1;
  [5] 1, 2, 3; (because A061395(5)=3, we have terms from 1 to 3)
  [6] 1, 2;    (because A061395(6)=2, we have terms from 1 to 2)
  [7] 1, 2, 3, 4; (because A061395(7)=4, we have terms from 1 to 4)
etc.
		

Crossrefs

One more than A241914.

Programs

Formula

a(1)=1, a(n) = n - A203623(A241920(n)-1) - 1.