id:A059874 - OEIS Search Results

Search: id:A059874

Displaying 1-1 of 1 results found.

page 1

The lexicographically first sequence of binary encodings of solutions satisfying the equation p_i = (1+mod(i,2))*p_{i-1} +- p_{i-2} +- p_{i-3} +- ... +- 2 + 1, where p_i is the i-th prime number.

+0
3

1, 3, 5, 13, 21, 51, 83, 175, 303, 639, 1143, 2539, 4571, 9711, 17903, 36735, 69499, 143339, 270327, 556031, 1080315, 2195431, 4259819, 8646647, 17031163, 34078647, 67632893, 136282091, 270467055 (list; graph; listen)

	OFFSET	`1,2`
	COMMENT	`I.e. like A059873, but the encodings must be "odd", with the least significant bit set. I do not know whether this sequence can be extended infinitely.`
	CROSSREFS	`Cf. A059873, A059875.` `Adjacent sequences: A059871 A059872 A059873 this_sequence A059875 A059876 A059877` `Sequence in context: A034484 A059872 A059873 this_sequence A059875 A086893 A014437`
	KEYWORD	`nonn`
	AUTHOR	`Antti Karttunen Feb 05 2001`
	EXTENSIONS	`More terms from Naohiro Nomoto (6284968128(AT)geocities.co.jp), Sep 12 2001`

page 1

Search completed in 0.002 seconds

Last modified October 13 09:05 EDT 2008. Contains 145008 sequences.

AT&T Labs Research