[go: up one dir, main page]

login
Revision History for A004744 (Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing entries 1-10 | older changes
Numbers whose binary expansion does not contain 011.
(history; published version)
#24 by Michel Marcus at Sun Feb 13 06:36:35 EST 2022
STATUS

reviewed

approved

#23 by Joerg Arndt at Sun Feb 13 02:40:41 EST 2022
STATUS

proposed

reviewed

#22 by Amiram Eldar at Sun Feb 13 01:47:09 EST 2022
STATUS

editing

proposed

#21 by Amiram Eldar at Sun Feb 13 01:41:33 EST 2022
LINKS

Robert Baillie and Thomas Schmelzer, <a href="https://library.wolfram.com/infocenter/MathSource/7166/">Summing Kempner's Curious (Slowly-Convergent) Series</a>, Mathematica Notebook kempnerSums.nb, Wolfram Library Archive, 2008.

FORMULA

Sum_{n>=2} 1/a(n) = 6.084750966700965350831194838591995529232464122788387705746226526437263331240... (calculated using Baillie and Schmelzer's kempnerSums.nb, see Links). - Amiram Eldar, Feb 13 2022

KEYWORD

nonn,base,easy

STATUS

approved

editing

#20 by Joerg Arndt at Wed Feb 17 01:58:14 EST 2021
STATUS

reviewed

approved

#19 by Michel Marcus at Wed Feb 17 01:53:14 EST 2021
STATUS

proposed

reviewed

#18 by Jon E. Schoenfield at Wed Feb 17 00:15:14 EST 2021
STATUS

editing

proposed

#17 by Jon E. Schoenfield at Wed Feb 17 00:15:12 EST 2021
NAME

Numbers n such that whose binary expansion does not contain 011.

AUTHOR
STATUS

approved

editing

#16 by Charles R Greathouse IV at Sat Feb 11 23:43:56 EST 2017
STATUS

editing

approved

#15 by Charles R Greathouse IV at Sat Feb 11 23:43:52 EST 2017
COMMENTS

A 2-automatic sequence. - Charles R Greathouse IV, Mar 26 2013

LINKS

<a href="/index/BiAr#binary2-automatic">Index entries for 2-automatic sequences related to binary expansion of n</a>.

PROG

(PARI) is(n)=while(n>10, if(bitand(n, 7)==3, return(0)); n>>=1); 1 \\ Charles R Greathouse IV, Feb 11 2017

STATUS

approved

editing