The On-Line Encyclopedia of Integer Sequences (OEIS)

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

A300867

a(n) is the least positive k such that k * n is a Fibbinary number (A003714).
(history; published version)

#15 by Michael De Vlieger at Mon Oct 28 16:24:12 EDT 2024

STATUS

proposed

approved

#14 by Antti Karttunen at Mon Oct 28 16:07:42 EDT 2024

STATUS

editing

proposed

#13 by Antti Karttunen at Mon Oct 28 16:07:27 EDT 2024

KEYWORD

nonn,look,base

STATUS

approved

editing

#12 by Susanna Cuyler at Thu Mar 15 06:18:20 EDT 2018

STATUS

proposed

approved

#11 by Rémy Sigrist at Thu Mar 15 01:24:24 EDT 2018

STATUS

editing

proposed

#10 by Rémy Sigrist at Thu Mar 15 01:19:34 EDT 2018

LINKS

Rémy Sigrist, <a href="/A300867/b300867.txt">Table of n, a(n) for n = 0..10000</a>

STATUS

approved

editing

Discussion

Thu Mar 15

01:24

Rémy Sigrist: added b-file

#9 by N. J. A. Sloane at Wed Mar 14 17:37:58 EDT 2018

STATUS

proposed

approved

#8 by Rémy Sigrist at Wed Mar 14 13:41:05 EDT 2018

STATUS

editing

proposed

#7 by Rémy Sigrist at Wed Mar 14 13:38:56 EDT 2018

COMMENTS

This sequence is well defined: for any positive n, according to the pigeonhole principle, A195156(i) mod n = A195156(j) mod n for some distinct i and j, hence n divides f = abs(A195156(i) - A195156(j)), and as f is a Fibbinary number, a(n) <= f/n.

#6 by Rémy Sigrist at Wed Mar 14 08:42:49 EDT 2018

FORMULA

a(n) = A300889(n) / n for any n > 0.

CROSSREFS

Cf. A003714, A070939, A195156, A300889.