A087675 -id:A087675 - cp's OEIS frontend

A087676 Consider recurrence b(0) = n/3, b(n) = b(0)*floor(b(n-1)); sequence gives number of steps to reach an integer, or -1 if no integer is ever reached.

0, 3, 5, 0, 1, 1, 0, 12, 2, 0, 3, 7, 0, 1, 1, 0, 2, 7, 0, 2, 2, 0, 1, 1, 0, 5, 5, 0, 7, 4, 0, 1, 1, 0, 6, 2, 0, 4, 3, 0, 1, 1, 0, 2, 5, 0, 2, 2, 0, 1, 1, 0, 3, 3, 0, 6, 3, 0, 1, 1, 0, 3, 2, 0, 5, 5, 0, 1, 1, 0, 2, 3, 0, 2, 2, 0, 1, 1, 0, 5, 4, 0, 3, 4, 0, 1, 1, 0, 5, 2, 0, 3, 4, 0, 1, 1, 0, 2, 4, 0, 2, 2, 0, 1, 1

Offset: 6

N. J. A. Sloane, following a suggestion of Bela Bajnok (bbajnok(AT)gettysburg.edu), Sep 27 2003

nonn

It is conjectured that an integer is always reached if the initial value is >= 2.

J. C. Lagarias and N. J. A. Sloane, Approximate squaring (pdf, ps), Experimental Math., 13 (2004), 113-128.

Cf. A087675, A087677.

A087677 Consider recurrence b(0) = n/3, b(n) = b(0)*floor(b(n-1)); sequence gives first integer reached, or -1 if no integer is ever reached.

Original entry on oeis.org

2, 21, 240, 3, 10, 11, 4, 170195636, 84, 5, 736, 922709, 6, 38, 40, 7, 374, 10751097, 8, 550, 598, 9, 84, 87, 10, 1173908, 1371360, 11, 262696240, 203210, 12, 148, 152, 13, 72879280, 2419, 14, 588799, 44088, 15, 230, 235, 16, 4263, 20523050, 17, 5096, 5300, 18, 330, 336

Offset: 6

N. J. A. Sloane, following a suggestion of Bela Bajnok (bbajnok(AT)gettysburg.edu), Sep 27 2003

nonn

It is conjectured that an integer is always reached if the initial value is >= 2.

J. C. Lagarias and N. J. A. Sloane, Approximate squaring (pdf, ps), Experimental Math., 13 (2004), 113-128.

Cf. A087675, A087676.

cp's OEIS Frontend

A087676 Consider recurrence b(0) = n/3, b(n) = b(0)*floor(b(n-1)); sequence gives number of steps to reach an integer, or -1 if no integer is ever reached.

Views

Author

Keywords

Comments

Links

Crossrefs