login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A369939 Numbers whose maximal exponent in their prime factorization is a Fibonacci number. 3
1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 65, 66, 67, 68, 69, 70, 71 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
First differs from its subsequence A115063 at n = 2448. a(2448) = 2592 = 2^5 * 3^4 is not a term of A115063.
First differs from A209061 at n = 62.
Numbers k such that A051903(k) is a Fibonacci number.
The asymptotic density of this sequence is 1/zeta(4) + Sum_{k>=5} (1/zeta(Fibonacci(k)+1) - 1/zeta(Fibonacci(k)+1)) = 0.94462177878047854647... .
LINKS
MATHEMATICA
fibQ[n_] := Or @@ IntegerQ /@ Sqrt[5*n^2 + {-4, 4}];
Select[Range[100], fibQ[Max[FactorInteger[#][[;; , 2]]]] &]
PROG
(PARI) isfib(n) = issquare(5*n^2 - 4) || issquare(5*n^2 + 4);
is(n) = n == 1 || isfib(vecmax(factor(n)[, 2]));
CROSSREFS
Similar sequences: A368714, A369937, A369938.
Sequence in context: A140823 A209061 A115063 * A178210 A013938 A339889
KEYWORD
nonn,easy
AUTHOR
Amiram Eldar, Feb 06 2024
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 17 23:53 EDT 2024. Contains 374377 sequences. (Running on oeis4.)