The On-Line Encyclopedia of Integer Sequences (OEIS)

Revisions by Joerg Arndt

(See also Joerg Arndt's wiki page
and changes approved by Joerg Arndt)

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

A376585

a(n) = 2^(2*n - 1) - 2^(n - 1)*(n - 1).
(history; published version)

#11 by Joerg Arndt at Mon Sep 30 10:09:45 EDT 2024

STATUS

proposed

reviewed

A376584

Fixed points in A375564.
(history; published version)

#9 by Joerg Arndt at Mon Sep 30 10:09:25 EDT 2024

STATUS

proposed

reviewed

A114567

a(n) is the number k such that the binary expansion of n mod 2^k is the postorder traversal of a binary tree, where 1 indicates a node and 0 indicates there are no children on that side.
(history; published version)

#36 by Joerg Arndt at Mon Sep 30 10:09:13 EDT 2024

STATUS

proposed

reviewed

A120380

Number of partitions of n*(n+1).
(history; published version)

#18 by Joerg Arndt at Mon Sep 30 10:08:26 EDT 2024

STATUS

proposed

reviewed

A000073

Tribonacci numbers: a(n) = a(n-1) + a(n-2) + a(n-3) for n >= 3 with a(0) = a(1) = 0 and a(2) = 1.
(history; published version)