id:A130971 - OEIS Search Results

Search: id:A130971

Displaying 1-1 of 1 results found.

page 1

Smallest prime p, such that either |A000040(n)-p| or A000040(n)+p is of the form 2^k.

+0
4

2, 2, 3, 3, 3, 3, 13, 3, 7, 3, 23, 5, 23, 11, 17, 11, 5, 3, 3, 7, 41, 47, 19, 73, 31, 37, 71, 43, 19, 97, 131, 3, 73, 11, 107, 23, 29, 131, 89, 83, 163, 53, 127, 191, 59, 71, 83, 191, 29, 101, 23, 17, 113, 5, 193, 7, 13, 239, 149, 277, 229, 37, 179, 307, 199, 61, 181 (list; graph; listen)

	OFFSET	`1,1`
	PROGRAM	`(Scheme:) (define (A130971 n) (let ((p1 (A000040 n))) (let loop ((i 1) (p2 2)) (cond ((pow2? (abs (- p1 p2))) p2) ((pow2? (+ p1 p2)) p2) (else (loop (+ i 1) (A000040 (+ i 1))))))))` `(define (pow2? n) (and (> n 0) (zero? (A004198bi n (- n 1)))))`
	CROSSREFS	`Cf. A130971, A130972, A103150.` `Adjacent sequences: A130968 A130969 A130970 this_sequence A130972 A130973 A130974` `Sequence in context: A124229 A055377 A128586 this_sequence A051776 A073734 A062558`
	KEYWORD	`nonn`
	AUTHOR	`Antti Karttunen (His-Firstname.His-Surname(AT)gmail.com), Jun 19 2007`

page 1

Search completed in 0.002 seconds

Last modified October 6 12:54 EDT 2008. Contains 144667 sequences.

AT&T Labs Research