The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A072378 (Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing entries 1-10 | older changes

A072378

Numbers n such that 12*n divides F(12*n), where F(m) is the m-th Fibonacci number.
(history; published version)

#23 by Bruno Berselli at Mon May 20 02:49:59 EDT 2019

STATUS

reviewed

approved

#22 by Michel Marcus at Mon May 20 00:55:13 EDT 2019

STATUS

proposed

reviewed

#21 by Petros Hadjicostas at Sun May 19 23:49:57 EDT 2019

STATUS

editing

proposed

Discussion

Mon May 20

00:12

Petros Hadjicostas: Or more precisely, it oscillates around 0.16, then around 0.17, then around 0.18, then around 0.19, etc.

#20 by Petros Hadjicostas at Sun May 19 23:49:44 EDT 2019

CROSSREFS

Cf. A128974, A317971.

A317971

#19 by Petros Hadjicostas at Sun May 19 23:49:31 EDT 2019

CROSSREFS

Cf. A128974.,

A317971

STATUS

proposed

editing

#18 by Petros Hadjicostas at Sun May 19 22:37:24 EDT 2019

STATUS

editing

proposed

Discussion

Sun May 19

23:30

Jon E. Schoenfield: "as can be proved" sounds good to me.

23:49

Petros Hadjicostas: OK, thanks! Jon, can you please check the asymptotic claim above? The ratio a(n)/n^phi seems to increase very slowly from 0.16 to 0.17 to 0.18 etc.

#17 by Petros Hadjicostas at Sun May 19 22:37:22 EDT 2019

COMMENTS

a(n) seems to be asymptotic to a constant multiple of n^phi , where phi is the golden ratio.

STATUS

proposed

editing

#16 by Petros Hadjicostas at Sun May 19 22:36:55 EDT 2019

STATUS

editing

proposed

#15 by Petros Hadjicostas at Sun May 19 22:36:53 EDT 2019

NAME

Numbers n such that 12n 12*n divides F(12n12*n) , where F(m) is the m-th Fibonacci number.

STATUS

proposed

editing

#14 by Petros Hadjicostas at Sun May 19 21:35:13 EDT 2019

STATUS

editing

proposed