Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                

Revision History for A110562

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

Showing entries 1-10 | older changes
Numbers n such that n in binary representation has a block of exactly a nontrivial pentagonal number of zeros.
(history; published version)
#16 by Alois P. Heinz at Wed Sep 11 14:15:04 EDT 2024
STATUS

reviewed

approved

#15 by Andrew Howroyd at Wed Sep 11 14:14:01 EDT 2024
STATUS

proposed

reviewed

#14 by Robert C. Lyons at Wed Sep 11 13:28:02 EDT 2024
STATUS

editing

proposed

#13 by Robert C. Lyons at Wed Sep 11 13:28:00 EDT 2024
EXAMPLE

64 is not in this sequence because, though 64 (base 2) = 1000000 has a block of 6 zeros, which has sub-blocks subblocks of 5 zeros, sub-blocks subblocks do not count.

STATUS

approved

editing

#12 by N. J. A. Sloane at Sat Dec 03 12:07:26 EST 2016
STATUS

proposed

approved

#11 by Michel Marcus at Sat Dec 03 00:12:19 EST 2016
STATUS

editing

proposed

#10 by Michel Marcus at Sat Dec 03 00:12:12 EST 2016
LINKS

J.-P. Allouche, <a href="http://www.mat.univie.ac.at/~slc/s/s30allouche.pdfhtml">Finite Automata and Arithmetic</a>, Séminaire Lotharingien de Combinatoire, B30c (1993), 23 pp.

STATUS

approved

editing

#9 by Jon E. Schoenfield at Sat Jul 11 10:27:07 EDT 2015
STATUS

editing

approved

#8 by Jon E. Schoenfield at Sat Jul 11 10:27:05 EDT 2015
COMMENTS

a(n) is the index of zeros in the complement of the pentagonal number analogue analog of the Baum-Sweet sequence, which is b(n) = 1 if the binary representation of n contains no block of consecutive zeros of exactly a nontrivial pentagonal number length A000326(i) for i>1; otherwise b(n) = 0.

STATUS

approved

editing

#7 by Russ Cox at Fri Mar 30 18:40:29 EDT 2012
AUTHOR

_Jonathan Vos Post (jvospost3(AT)gmail.com), _, Sep 12 2005

Discussion
Fri Mar 30
18:40
OEIS Server: https://oeis.org/edit/global/228