login

Revision History for A220517

(Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing entries 1-10 | older changes
First differences of A225600. Also A141285 and A194446 interleaved.
(history; published version)
#29 by T. D. Noe at Mon Nov 04 18:06:27 EST 2013
STATUS

proposed

approved

#28 by Omar E. Pol at Sun Nov 03 20:00:35 EST 2013
STATUS

editing

proposed

#27 by Omar E. Pol at Sun Nov 03 19:57:01 EST 2013
FORMULA

a(2n-1) = A141285(n); a(2n) = A194446(n), n >= 1

STATUS

approved

editing

Discussion
Sun Nov 03
19:59
Omar E. Pol: Added formula. See the title.
#26 by N. J. A. Sloane at Wed Jul 31 22:30:28 EDT 2013
STATUS

proposed

approved

#25 by Omar E. Pol at Wed Jul 31 13:12:57 EDT 2013
STATUS

editing

proposed

#24 by Omar E. Pol at Wed Jul 31 13:12:51 EDT 2013
STATUS

proposed

editing

#23 by Omar E. Pol at Wed Jul 31 13:12:03 EDT 2013
STATUS

editing

proposed

#22 by Omar E. Pol at Wed Jul 31 13:10:41 EDT 2013
NAME

Number of toothpicks added at n-th stage to the toothpick structure (related to integer partitions) of A225600.

First differences of A225600. Also A141285 and A194446 interleaved.

COMMENTS

First differences Number of toothpicks added at n-th stage to the toothpick structure (related to integer partitions) of A225600. Also A141285 and A194446 interleaved.

EXAMPLE

Also using the elements of this diagram we can draw a Dyck path in which the n-th odd-indexed segment has A141285(n) up-steps and the n-th even-indexed segment has A194446(n) down-steps. Note that the height of the n-th largest peak between two valleys at height 0 is also the partition number A000041(n). See below:

. 1, 3, 4, 9, 19, 33... = A179862

STATUS

approved

editing

Discussion
Wed Jul 31
13:12
Omar E. Pol: Fix typo and improvements in a young sequence.
#21 by R. J. Mathar at Tue Jul 30 14:35:47 EDT 2013
STATUS

editing

approved

#20 by R. J. Mathar at Tue Jul 30 14:35:12 EDT 2013
EXAMPLE

. 1, 3, 9, 19, 33... = A225594

STATUS

approved

editing