The On-Line Encyclopedia of Integer Sequences (OEIS)

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

A000931

Padovan sequence (or Padovan numbers): a(n) = a(n-2) + a(n-3) with a(0) = 1, a(1) = a(2) = 0.
(history; published version)

#640 by Michael De Vlieger at Thu Oct 24 12:33:20 EDT 2024

STATUS

reviewed

approved

#639 by Michel Marcus at Thu Oct 24 11:39:55 EDT 2024

STATUS

proposed

reviewed

#638 by Michael De Vlieger at Thu Oct 24 10:39:12 EDT 2024

STATUS

editing

proposed

#637 by Michael De Vlieger at Thu Oct 24 10:39:07 EDT 2024

LINKS

Mohamadou Bachabi and Alain S. Togbé, <a href="https://hrcak.srce.hr/file/464241">Products of Fermat or Mersenne numbers in some sequences</a>, Math. Comm. (2024) Vol. 29, 265-285.

STATUS

approved

editing

#636 by N. J. A. Sloane at Wed Sep 11 00:47:15 EDT 2024

STATUS

proposed

approved

#635 by Enrique Navarrete at Sun Sep 01 00:03:52 EDT 2024

STATUS

editing

proposed

#634 by Enrique Navarrete at Sat Aug 31 23:53:38 EDT 2024

COMMENTS

For n >= 2, a(n+5) is the number of ways to tile the 1xn board with dominoes and squares (ie. size 1x1) such that are either none or one squares between dominoes, none or one squares at both ends of the board, and there is at least one domino. For example, for n=6, a(11)=4 since the tilings are |2|2, |22|, 2|2| and 222 (where 2 represents a domino and | a square). - Enrique Navarrete, Aug 31 2024

STATUS

approved

editing

#633 by Andrew Howroyd at Thu Aug 15 19:04:50 EDT 2024

STATUS

reviewed

approved

#632 by Stefano Spezia at Thu Aug 15 16:07:49 EDT 2024

STATUS

proposed

reviewed

#631 by Michael De Vlieger at Thu Aug 15 11:20:07 EDT 2024

STATUS

editing

proposed