This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A258204 Number of one-sided strictly non-overlapping holeless polyhexes of perimeter 2n, counted up to rotation. 6
 0, 0, 1, 0, 1, 1, 3, 3, 16, 23, 80, 183, 563 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,7 COMMENTS For n >= 1, a(n) gives the total number of terms k in A258003 with binary width = 2n + 1, or equally, with A000523(k) = 2n. LINKS FORMULA Other identities and observations. For all n >= 1: a(n) = 2*A258206(n) - A258205(n). a(n) <= A258017(n). PROG (Scheme) (define (A258204 n) (let loop ((k (+ 1 (expt 2 (+ n n)))) (c 0)) (cond ((pow2? k) c) (else (loop (+ 1 k) (+ c (if (isA258003? k) 1 0))))))) (define (pow2? n) (let loop ((n n) (i 0)) (cond ((zero? n) #f) ((odd? n) (and (= 1 n) i)) (else (loop (/ n 2) (1+ i)))))) ;; Gives non-false only when n is a power of two. ;; Code for isA258003? given in A258003. CROSSREFS Cf. A057779, A258003, A258017, A258205, A258206. Sequence in context: A222505 A292356 A209020 * A258017 A209055 A209212 Adjacent sequences:  A258201 A258202 A258203 * A258205 A258206 A258207 KEYWORD nonn,more AUTHOR Antti Karttunen, May 31 2015 STATUS approved

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

Last modified October 23 20:17 EDT 2019. Contains 328373 sequences. (Running on oeis4.)