cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-2 of 2 results.

A048721 Binary packing of Fibonacci sequence A000045.

Original entry on oeis.org

0, 1, 3, 7, 23, 151, 4247, 1052823, 8590987415, 18014407100469399, 309485009839359475825250455, 11150372599265311880252868975683656578240663, 6901746346790563787434755873427398051716420852423255530846180802039959
Offset: 0

Views

Author

Antti Karttunen, Mar 30 1999

Keywords

Comments

Prime values of a(n) begin 3, 7, 23, 151, i.e., for n = 2, 3, 4, 5. Semiprime values of a(n) begin 4247 = 31 * 137, 1052823 = 3 * 350941, i.e., for n = 6, 7. - Jonathan Vos Post, May 09 2005

Crossrefs

Cf. A000045, A005203, A048722, A036571.

Formula

a(0) = 0, a(n) = a(n-1)+(2^(Fib(n+1)-1)).

A048722 Reversed binary packing of Fibonacci sequence A000045.

Original entry on oeis.org

0, 1, 3, 7, 29, 233, 7457, 1908993, 15638470657, 32796250015268865, 563435284988077103288156161, 20299895516157546089301785397257605216206849, 12565026726380593749379544715414757684521993402717913413208480665305089
Offset: 0

Views

Author

Antti Karttunen, Mar 30 1999

Keywords

Crossrefs

Cf. A000045, A005203, A048721, A036571.

Formula

a(0) = 0, a(n) = (a(n-1)*(2^(Fib(n-1)))) + 1
Showing 1-2 of 2 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.