id:A073435 - OEIS Search Results

Search: id:A073435

Displaying 1-1 of 1 results found.

page 1

Smallest x such that remainder if x-th composite is divided by Pi[x] equals n.

+0
3

4, 7, 8, 13, 30, 17, 35, 23, 40, 50, 53, 51, 55, 52, 63, 60, 68, 69, 146, 76, 154, 83, 156, 162, 172, 177, 185, 109, 195, 187, 192, 188, 189, 190, 208, 209, 210, 214, 215, 216, 217, 230, 218, 219, 220, 224, 225, 251, 248, 249, 250, 255, 256, 262, 267, 280, 289 (list; graph; listen)

	OFFSET	`1,1`
	FORMULA	`a(n)=Min{x; Mod[A002808(x), A000720(x)]=n}=Min{x; A065861(x)=n}`
	EXAMPLE	`Remainder=4 appears first as Mod[c[13],Pi[13]]=Mod[22,6]=4, so a(4)=13.`
	CROSSREFS	`Cf. A000720, A002808, A065861.` `Sequence in context: A047536 A093494 A051027 this_sequence A086987 A051219 A007285` `Adjacent sequences: A073432 A073433 A073434 this_sequence A073436 A073437 A073438`
	KEYWORD	`nonn`
	AUTHOR	`Labos E. (labos(AT)ana.sote.hu), Jul 31 2002`

page 1

Search completed in 0.002 seconds

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.

AT&T Labs Research