A061390 - OEIS

This site is supported by donations to The OEIS Foundation.

A061390

Use same rules as A047988. Sequence gives smallest numbers which require n steps to reach 2.

3, 5, 7, 14, 38, 172, 823, 6185, 87223, 1940494 (list; graph; refs; listen; history; internal format)

	OFFSET	`1,1`
	COMMENTS	`Some values calculated by Joseph Devincentis.` `a(11) > 5000000. - David Wasserman (wasserma(AT)spawar.navy.mil), Jun 21 2002`
	LINKS	`Erich Friedman, Math. Magic`
	CROSSREFS	`Cf. A047984.` `Sequence in context: A118743 A114980 A024372 * A051445 A002181 A073692` `Adjacent sequences: A061387 A061388 A061389 * A061391 A061392 A061393`
	KEYWORD	`nonn`
	AUTHOR	`Jason Earls (zevi_35711(AT)yahoo.com), Jun 09 2001`
	EXTENSIONS	`More terms from David Wasserman (wasserma(AT)spawar.navy.mil), Jun 21 2002`

Content is available under The OEIS End-User License Agreement .

Last modified February 15 21:56 EST 2012. Contains 205860 sequences.