id:A073855 - OEIS Search Results

Search: id:A073855

Displaying 1-1 of 1 results found.

page 1

Number of steps to reach 0 starting with n and applying the process x ->bigomega(x).

+0
2

1, 2, 2, 3, 2, 3, 2, 3, 3, 3, 2, 3, 2, 3, 3, 4, 2, 3, 2, 3, 3, 3, 2, 4, 3, 3, 3, 3, 2, 3, 2, 3, 3, 3, 3, 4, 2, 3, 3, 4, 2, 3, 2, 3, 3, 3, 2, 3, 3, 3, 3, 3, 2, 4, 3, 4, 3, 3, 2, 4, 2, 3, 3, 4, 3, 3, 2, 3, 3, 3, 2, 3, 2, 3, 3, 3, 3, 3, 2, 3, 4, 3, 2, 4, 3, 3, 3, 4, 2, 4, 3, 3, 3, 3, 3, 4, 2, 3, 3, 4, 2, 3, 2, 4, 3 (list; graph; listen)

	OFFSET	`1,2`
	FORMULA	`a(n)=1+a(bigomega(n)). - Vladeta Jovovic (vladeta(AT)eunet.rs), Jul 10 2004`
	EXAMPLE	`bigomega(36) = 4, bigomega(4) = 2, bigomega(2) = 1, bigomega(1) = 0, hence a(36) = 4.`
	MAPLE	`a(n)=if(n<0, 0, s=n; c=1; while(bigomega(s)>0, s=bigomega(s); c++); c)`
	CROSSREFS	`A036430(n) + 1.` `Sequence in context: A029374 A049237 A162361 this_sequence A077982 A099427 A059964` `Adjacent sequences: A073852 A073853 A073854 this_sequence A073856 A073857 A073858`
	KEYWORD	`easy,nonn`
	AUTHOR	`Benoit Cloitre (benoit7848c(AT)orange.fr), Sep 02 2002`
	EXTENSIONS	`More terms from Vladeta Jovovic (vladeta(AT)eunet.rs), Jul 10 2004`

page 1

Search completed in 0.002 seconds

Last modified December 20 00:58 EST 2009. Contains 171054 sequences.

AT&T Labs Research