The On-Line Encyclopedia of Integer Sequences (OEIS)

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

A127787

Numbers n such that F(n) divides F(F(n)), where F(n) is a Fibonacci number.
(history; published version)

#13 by Alois P. Heinz at Fri Oct 09 18:23:26 EDT 2015

STATUS

editing

approved

#12 by Alois P. Heinz at Fri Oct 09 10:33:55 EDT 2015

MAPLE

with(combinat): a:=proc(n) if type(fibonacci(fibonacci(n))/fibonacci(n), integer)=true then n else end if end proc: seq(a(n), n=1..40); # Emeric Deutsch, Aug 24 2007

#11 by Alois P. Heinz at Fri Oct 09 10:22:32 EDT 2015

CROSSREFS

Cf. A263101.

#10 by Alois P. Heinz at Fri Oct 09 10:20:28 EDT 2015

COMMENTS

Comment from _Stefan Steinerberger_, Dec 20 2007: It is known that for n > 2 Fibonacci(n) divides Fibonacci(m) if and only if n divides m. Therefore if the term "2" is omitted this is identical to A023172, which see for further information. - _Stefan Steinerberger_, Dec 20 2007

MAPLE

with(combinat): a:=proc(n) if type(fibonacci(fibonacci(n))/fibonacci(n), integer)=true then n else end if end proc: seq(a(n), n=1..40); - _# _Emeric Deutsch_, Aug 24 2007

STATUS

approved

editing

#9 by Russ Cox at Sat Mar 31 13:20:34 EDT 2012

AUTHOR

_Alexander Adamchuk (alex(AT)kolmogorov.com), _, May 13 2007

Discussion

Sat Mar 31

13:20

OEIS Server: https://oeis.org/edit/global/879

#8 by Russ Cox at Fri Mar 30 18:49:45 EDT 2012

COMMENTS

Comment from _Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), _, Dec 20 2007: It is known that for n > 2 Fibonacci(n) divides Fibonacci(m) if and only if n divides m. Therefore if the term "2" is omitted this is identical to A023172, which see for further information.

Discussion

Fri Mar 30

18:49

OEIS Server: https://oeis.org/edit/global/238

#7 by Russ Cox at Fri Mar 30 17:36:12 EDT 2012

MAPLE

with(combinat): a:=proc(n) if type(fibonacci(fibonacci(n))/fibonacci(n), integer)=true then n else end if end proc: seq(a(n), n=1..40); - _Emeric Deutsch (deutsch(AT)duke.poly.edu), _, Aug 24 2007

Discussion

Fri Mar 30

17:36

OEIS Server: https://oeis.org/edit/global/173

#6 by Russ Cox at Fri Mar 30 16:50:40 EDT 2012

EXTENSIONS

Edited by _N. J. A. Sloane (njas(AT)research.att.com), _, Dec 22 2007

Discussion

Fri Mar 30

16:50

OEIS Server: https://oeis.org/edit/global/110

#5 by N. J. A. Sloane at Sat Oct 02 03:00:00 EDT 2010

COMMENTS

Comment from Stefan Steinerberger (stefan.steinerberger(AT)gmail.com>, ), Dec 20 2007: It is known that for n > 2 Fibonacci(n) divides Fibonacci(m) if and only if n divides m. Therefore if the term "2" is omitted this is identical to A023172, which see for further information.

KEYWORD

nonn,new

nonn

#4 by N. J. A. Sloane at Fri Feb 27 03:00:00 EST 2009

KEYWORD

nonn,new

nonn

EXTENSIONS

Edited by N. J. A. Sloane (njas, (AT)research.att.com), Dec 22 2007