The On-Line Encyclopedia of Integer Sequences (OEIS)

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

Revision History for A349451

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

A349451

Dirichlet inverse of Fibonacci numbers, when started from A000045(1): 1, 1, 2, 3, 5, 8, 13, 21, ...
(history; published version)

#19 by Michael De Vlieger at Thu Feb 24 08:58:54 EST 2022

STATUS

reviewed

approved

#18 by Joerg Arndt at Thu Feb 24 02:10:44 EST 2022

STATUS

proposed

reviewed

#17 by Ilya Gutkovskiy at Wed Feb 23 14:02:20 EST 2022

STATUS

editing

proposed

#16 by Ilya Gutkovskiy at Wed Feb 23 13:56:10 EST 2022

FORMULA

G.f. A(x) satisfies: A(x) = x - Sum_{k>=2} Fibonacci(k) * A(x^k). - Ilya Gutkovskiy, Feb 23 2022

STATUS

approved

editing

#15 by N. J. A. Sloane at Wed Nov 24 09:27:57 EST 2021

STATUS

proposed

approved

#14 by Antti Karttunen at Wed Nov 24 05:54:52 EST 2021

STATUS

editing

proposed

#13 by Antti Karttunen at Wed Nov 24 05:51:51 EST 2021

CROSSREFS

Cf. also A349449, A349450, A349452, A349453, A349566.

STATUS

proposed

editing

#12 by Antti Karttunen at Wed Nov 24 05:35:46 EST 2021

STATUS

editing

proposed

#11 by Antti Karttunen at Wed Nov 24 05:29:51 EST 2021

LINKS

Antti Karttunen, <a href="/A349451/b349451.txt">Table of n, a(n) for n = 1..1001</a>

STATUS

approved

editing

#10 by Susanna Cuyler at Mon Nov 22 08:11:28 EST 2021

STATUS

proposed

approved