A375768 The maximum exponent in the prime factorization of the numbers whose maximum exponent in their prime factorization is a Fibonacci number.

0, 1, 1, 2, 1, 1, 1, 3, 2, 1, 1, 2, 1, 1, 1, 1, 2, 1, 2, 1, 1, 1, 3, 2, 1, 3, 2, 1, 1, 1, 5, 1, 1, 1, 2, 1, 1, 1, 3, 1, 1, 1, 2, 2, 1, 1, 2, 2, 1, 2, 1, 3, 1, 3, 1, 1, 1, 2, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 3, 1, 1, 2, 2, 1, 1, 1, 1, 1, 2, 1, 1, 1, 3, 1, 2, 1, 2, 1, 1, 1, 5, 1, 2, 2, 2, 1, 1, 1, 3, 1, 1, 1, 3, 1, 1

Offset

1,4

Comments

First differs from A375766 at n = 2448.

All the terms are Fibonacci numbers by definition.

Links

Amiram Eldar, Table of n, a(n) for n = 1..10000

Formula

a(n) = A051903(A369939(n)).

a(n) = A000045(A375769(n)).

Asymptotic mean: Limit_{m->oo} (1/m) * Sum_{k=1..m} a(k) = (1/zeta(2) + Sum_{k>=3} (Fibonacci(k) * (1/zeta(Fibonacci(k)+1) - 1/zeta(Fibonacci(k)))) / d = 1.52660290991620063268..., where d = 1/zeta(4) + Sum_{k>=5} (1/zeta(Fibonacci(k)+1) - 1/zeta(Fibonacci(k))) = 0.94462177878047854647... is the density of A369939.

Mathematica

fibQ[n_] := Or @@ IntegerQ /@ Sqrt[5*n^2 + {-4, 4}]; s[n_] := Module[{e = Max[FactorInteger[n][[;; , 2]]]}, If[fibQ[e], e, Nothing]]; s[1] = 0; Array[s, 100]

Prog

(PARI) isfib(n) = issquare(5*n^2 - 4) || issquare(5*n^2 + 4);
lista(kmax) = {my(e); print1(0, ", "); for(k = 2, kmax, e = vecmax(factor(k)[, 2]); if(isfib(e), print1(e, ", "))); }

Crossrefs

Cf. A000045, A051903, A369939, A375766, A375769.

Sequence in context: A332954 A115568 A375766 * A072909 A360721 A365552

Adjacent sequences: A375765 A375766 A375767 * A375769 A375770 A375771

Keyword

nonn,easy,new

Author

Amiram Eldar, Aug 27 2024

Status

approved