A262361 -id:A262361 - cp's OEIS frontend

A058051 a(n) = F(F(F(n))), where F is a Fibonacci number (A000045).

0, 1, 1, 1, 1, 5, 10946, 2211236406303914545699412969744873993387956988653

Offset: 0

Robert G. Wilson v, Nov 18 2000

a(8) = 1695216512..7257812353 has 2288 decimal digits and a(9) = 3525796792..4659808333 has 1191833 decimal digits. - Alois P. Heinz, Nov 11 2015

Cf. A000045, A007570, A262361.

F:= n-> (<<0|1>, <1|1>>^n)[1, 2]:
a:= n-> F(F(F(n))):
seq(a(n), n=0..7);  # Alois P. Heinz, Nov 11 2015

F[0] = 0; F[1] = 1; F[n_] := F[n] = F[n - 1] + F[n - 2]; Table[ F[ F[ F[n] ] ], {n, 0, 10} ]
Table[Nest[Fibonacci,n,3],{n,0,8}] (* Harvey P. Dale, Feb 09 2018 *)

Offset corrected by Alois P. Heinz, Nov 11 2015

A338889 a(n) = L(L(L(n))) mod L(L(n)), where L = Lucas numbers = A000032.

Original entry on oeis.org

1, 0, 3, 1, 1, 1, 0, 1, 1, 29, 7, 1, 19679776435706023589554718882448088434898811874077010905231927243854, 1, 7

Offset: 0

Alois P. Heinz, Nov 14 2020

nonn

a(21) = 2992285359..7163788371 has 5090 decimal digits.

Alois P. Heinz, Table of n, a(n) for n = 0..20

Cf. A000032, A005371, A262361, A274996, A338638, A338736.

b:= proc(n) local r, M, p; r, M, p:=
      <<1|0>, <0|1>>, <<0|1>, <1|1>>, n;
      do if irem(p, 2, 'p')=1 then r:=
        `if`(nargs=1, r.M, r.M mod args[2]) fi;
         if p=0 then break fi; M:=
        `if`(nargs=1, M.M, M.M mod args[2])
      od; (r.<<2, 1>>)[1$2]
    end:
a:= n-> (h-> b(h$2) mod h)(b(b(n))):
seq(a(n), n=0..15);

a(n) = A262361(n) mod A005371(n).

cp's OEIS Frontend

A058051 a(n) = F(F(F(n))), where F is a Fibonacci number (A000045).

Views

Author

Keywords

Comments

Crossrefs

Programs

Maple

Mathematica

Extensions