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.

A271418 Define a sequence by b(1) = n, b(m) = b(m-1) + b(m-1)/A052126(m) + 1; then a(n) is the least m such that b(m) belongs to A270807.

Original entry on oeis.org

1, 3, 1, 2, 1, 2, 1, 2, 1, 2, 2, 3, 1, 3, 1, 2, 2, 2, 1, 2, 1, 2, 2, 2, 1, 3, 2, 2, 2, 2, 1, 4, 1, 2, 3, 4, 1, 3, 1, 4, 2, 4, 1, 4, 1, 4, 4, 4, 3, 2, 2, 3, 2, 2, 1, 4, 2, 2, 2, 2, 1, 4, 1, 3, 3, 2, 3, 2, 2, 3, 2, 3, 1, 4, 1
Offset: 1

Views

Author

Cody M. Haderlie, Apr 06 2016

Keywords

Examples

			the sequence where b(1) = 2 is 2, 4, 7, 9, 13, 15, ...
7 is shared with A270807
there are 3 terms in 2, 4, 7; a(2) = 3
		

Crossrefs

Programs

  • Mathematica
    f[n_] := n + n/FactorInteger[n][[-1, 1]] + 1; s = NestList[f, 1, 10^2]; Table[Length@ NestWhileList[f, n, ! MemberQ[s, #] &], {n, 120}] (* Michael De Vlieger, Apr 08 2016 *)

Extensions

a(75) corrected by Chai Wah Wu, Apr 06 2016