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.

Showing 1-3 of 3 results.

A095910 Where the modified Juggler sequence reaches a new record.

Original entry on oeis.org

2, 3, 7, 25, 73, 101, 471, 549, 791, 837, 1199, 2267, 29773, 38653, 273317, 2776203, 3683335, 4975111, 8087437
Offset: 1

Views

Author

Robert G. Wilson v, Jun 14 2004

Keywords

Comments

The modified Juggler sequence: begin with x and if x is even, round(sqrt(x)) -> x and if x is odd, round(sqrt(x3)) -> x and repeat until x = 1, count the iterations.
273317 reaches a maximum of 1640703316...(skip the next 35800 digits)...2531417380 during its trip to 1.
Comment from R. J. Mathar, Jul 28 2007: The records A094697 and A095910 are probably the same sequence.

Crossrefs

Cf. A007321, A095909, A095911.

Programs

  • Mathematica
    mjs[n_] := If[ EvenQ[n], Round[ Sqrt[n]], Round[ Sqrt[n^3]]]; f[n_] := Length[ NestWhileList[mjs, n, # != 1 &]] - 1; a = {0}; Do[ b = f[n]; If[b > a[[ -1]], AppendTo[a, b]], {n, 250000}]; a

Extensions

a(16)-a(19) from Chai Wah Wu, Aug 18 2016

A094696 Records in A007321.

Original entry on oeis.org

0, 1, 6, 13, 19, 21
Offset: 0

Views

Author

N. J. A. Sloane, Jun 09 2004

Keywords

Comments

Comment from R. J. Mathar, Jul 28 2007: The records A094696 and A095911 are probably the same sequence.

Crossrefs

Cf. A007321, A094697.

A095909 First occurrence of n in the modified Juggler sequence.

Original entry on oeis.org

2, 4, 14, 11, 5, 3, 8, 35, 15, 9, 43, 19, 7, 41, 173, 31, 693, 123, 25, 437, 73, 2239, 303, 215, 1349, 165, 9549, 875, 655, 3439, 229, 121, 1401, 599, 163, 853, 295, 103, 307, 157, 2067, 841, 26179, 883, 775, 8465, 417, 639, 3099, 1487, 44857, 1275, 1307
Offset: 1

Views

Author

Robert G. Wilson v, Jun 14 2004

Keywords

Comments

The modified Juggler sequence: begin with x and if x is even, round(sqrt(x)) -> x and if x is odd, round(sqrt(x3)) -> x and repeat until x = 1, count the iterations.

Crossrefs

Cf. A007321, A095910, A095911.

Programs

  • Mathematica
    mjs[n_] := If[ EvenQ[n], Round[ Sqrt[n]], Round[ Sqrt[n^3]]]; f[n_] := Length[ NestWhileList[mjs, n, # != 1 &]] - 1; a = Table[0, {66}]; Do[ b = f[n]; If[b < 67 && a[[b]] == 0, a[[b]] = n], {n, 44900}]; a
Showing 1-3 of 3 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

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