id:A075522 - OEIS Search Results

Search: id:A075522

Displaying 1-1 of 1 results found.

page 1

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.

+0
3

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 (list; graph; listen)

	OFFSET	`1,4`
	COMMENT	`a(A075521(n)) > 1;` `a(n) = a(A075520(n))+1 for n with A075520(n) prime.`
	EXAMPLE	`A000040(4)=7 and (7 mod 4) = 3: 7 -> 47+3=31 -> 431+3=127 -> 4*127+3=511 = A075523(4), therefore a(4)=3.`
	CROSSREFS	`Cf. A075520, A075519.` `Sequence in context: A065744 A016455 A060574 this_sequence A090544 A038766 A080993` `Adjacent sequences: A075519 A075520 A075521 this_sequence A075523 A075524 A075525`
	KEYWORD	`nonn`
	AUTHOR	`Reinhard Zumkeller (reinhard.zumkeller(AT)lhsystems.com), Sep 19 2002`

page 1

Search completed in 0.002 seconds

Last modified July 6 17:22 EDT 2008. Contains 140988 sequences.

AT&T Labs Research