id:A054641 - OEIS Search Results

Search: id:A054641

Displaying 1-1 of 1 results found.

page 1

GCD of divisor-sum of primorials and primorials itself = GCD[A002110(n), A000203(A002110(n))].

+0
3

1, 6, 6, 6, 6, 42, 42, 210, 210, 210, 210, 3990, 3990, 43890, 43890, 43890, 43890, 1360590, 23130030, 23130030, 855811110, 855811110, 855811110, 855811110, 855811110, 855811110, 11125544430, 11125544430, 11125544430, 11125544430 (list; graph; listen)

	OFFSET	`1,2`
	COMMENT	`1. Values are repeated for several arguments: observed from 1 to 8 times below n=100. Sites of jump seems not so regular. 2. From a sufficiently high value of n, A002110(n) divides the terms. E.g. from n=27, A002110(8) divides the values of this sequences.`
	CROSSREFS	`A002110, A000203, A028815, A054640, A054642.` `Sequence in context: A001734 A092937 A116571 this_sequence A024731 A098537 A131703` `Adjacent sequences: A054638 A054639 A054640 this_sequence A054642 A054643 A054644`
	KEYWORD	`nonn`
	AUTHOR	`Labos E. (labos(AT)ana.sote.hu), May 15 2000`

page 1

Search completed in 0.002 seconds

Last modified November 27 22:38 EST 2009. Contains 167602 sequences.

AT&T Labs Research