[go: up one dir, main page]

login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
Revision History for A346309 (Underlined text is an addition; strikethrough text is a deletion.)

Showing entries 1-10 | older changes
A346309 Positions of words in A076478 such that #0's - #1's is odd.
(history; published version)
#17 by Peter Luschny at Sun Oct 31 07:48:37 EDT 2021
STATUS

reviewed

approved

#16 by Andrey Zabolotskiy at Sat Oct 30 15:35:47 EDT 2021
STATUS

proposed

reviewed

#15 by Clark Kimberling at Tue Oct 12 11:38:46 EDT 2021
STATUS

editing

proposed

#14 by Clark Kimberling at Tue Oct 12 11:38:28 EDT 2021
EXAMPLE

The first fourteen words w(n) are 0, 1, 00, 01, 10, 11, 000, 001, 010, 011, 100, 101, 110, 111, so that a(3) = 7.

#13 by Clark Kimberling at Tue Oct 12 11:38:12 EDT 2021
EXAMPLE

The first fourteen words w(n) are 0, 1, 00, 01, 10, 11, 000, 001, 010, 011, 100, 101, 110, 111, so that a(3) = 7.

STATUS

proposed

editing

#12 by Clark Kimberling at Sat Oct 02 16:29:55 EDT 2021
STATUS

editing

proposed

#11 by Clark Kimberling at Sat Oct 02 16:28:14 EDT 2021
CROSSREFS

Cf. A007931, A076478, A346310 (complement), A053764A053754.

STATUS

proposed

editing

#10 by Jon E. Schoenfield at Sat Sep 11 16:20:18 EDT 2021
STATUS

editing

proposed

#9 by Jon E. Schoenfield at Sat Sep 11 16:20:15 EDT 2021
FORMULA

a(n) = ) = A053754(n+1) + 1, conjectured.

STATUS

proposed

editing

#8 by Clark Kimberling at Sat Sep 11 15:09:13 EDT 2021
STATUS

editing

proposed

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 1 06:23 EDT 2024. Contains 375575 sequences. (Running on oeis4.)