Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
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 A330083

(Underlined text is an addition; strikethrough text is a deletion.)

Showing entries 1-10 | older changes
A330083 a(n) is the smallest number k > 0 such that for each b = 2..n the base-b expansion of k has exactly n - b zeros.
(history; published version)
#20 by N. J. A. Sloane at Fri Jan 10 12:24:23 EST 2020
STATUS

proposed

approved

#19 by Felix Fröhlich at Mon Dec 09 13:40:22 EST 2019
STATUS

editing

proposed

#18 by Felix Fröhlich at Mon Dec 09 13:38:05 EST 2019
NAME

a(n) is the smallest number k > 0 such that for each b = 2..n the base-b expansion of k has exactly n - b zeros.

Discussion
Mon Dec 09 13:40
Felix Fröhlich: So, should the second comment be removed?
#17 by Felix Fröhlich at Mon Dec 09 13:37:33 EST 2019
DATA

31, 2, 10, 18, 271

OFFSET

2,12

PROG

a(n) = for(k=21, oo, for(b=2, n, if(count_zeros(digits(k, b))!=n-b, break, if(b==n, return(k)))))

EXTENSIONS

Value of a(2) adjusted by Felix Fröhlich, Dec 09 2019

STATUS

proposed

editing

#16 by Stefano Spezia at Mon Dec 09 03:55:21 EST 2019
STATUS

editing

proposed

Discussion
Mon Dec 09 04:06
Michel Marcus: I asked Felix if he could come and see
13:35
Felix Fröhlich: Regarding the value of a(2): it is 3 because this is the value the program returns for n = 2 :P I do agree that it makes sense to also permit 1.
#15 by Stefano Spezia at Mon Dec 09 03:53:29 EST 2019
KEYWORD

nonn,base,fini,full,new

STATUS

proposed

editing

Discussion
Mon Dec 09 03:55
Stefano Spezia: For finite sequences totally given in DATA the keyword “full” together with “fini” is necessary
#14 by Christopher Cormier at Sun Dec 08 14:56:27 EST 2019
STATUS

editing

proposed

#13 by Christopher Cormier at Sun Dec 08 14:54:17 EST 2019
COMMENTS

This list is complete. Proof: When converting base 2 to base 4, we can group the digits in base 2 into pairs from the least significant bit. We then convert pairs into single digits in base 4 as 00 -> 0, 01 -> 1, 10 -> 2, 11 -> 3. This always causes the number of zeros to go to half or less than half. For all n >= 7, n-4 is greater than (n-2)/2, so the condition is impossible. - Christopher Cormier, Dec 08 2019

KEYWORD

nonn,base,hard,morefini,new

STATUS

approved

editing

Discussion
Sun Dec 08 14:56
Christopher Cormier: Why is the first value in the sequence 3 instead of a(2) = 1? 1 in binary is still 1 which has no zeros.
#12 by Giovanni Resta at Tue Dec 03 03:44:47 EST 2019
STATUS

reviewed

approved

#11 by Peter Luschny at Tue Dec 03 03:30:46 EST 2019
STATUS

proposed

reviewed

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 August 18 18:17 EDT 2024. Contains 375273 sequences. (Running on oeis4.)