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.

A075522 Number of steps to reach the first nonprime (=A075523(n)) starting with the n-th prime p and iterating the map k -> 4*k+(p mod 4), or -1 if no integer is ever reached.

Original entry on oeis.org

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

Views

Author

Reinhard Zumkeller, Sep 19 2002

Keywords

Comments

a(A075521(n)) > 1;
a(n) = a(A075520(n))+1 for n with A075520(n) prime.

Examples

			A000040(4)=7 and (7 mod 4) = 3: 7 -> 4*7+3=31 -> 4*31+3=127 -> 4*127+3=511 = A075523(4), therefore a(4)=3.
		

Crossrefs