id:A133902 - OEIS Search Results

Search: id:A133902

Displaying 1-1 of 1 results found.

page 1

a(n)= a(n-1)* d(n) if gcd((n,a(n-1))=1, else a(n)= a(n-1)/gcd(n,a(n-1)). Here gcd(n,a(n-1))is greatest common divisor, d(n) is number of divisors.

+0
1

1, 1, 2, 4, 1, 2, 1, 2, 1, 3, 12, 24, 2, 4, 2, 8, 1, 2, 1, 2, 1, 4, 2, 4, 1, 3, 12, 48, 12, 24, 12, 24, 3, 1, 4, 16, 4, 8, 4, 16, 2, 4, 2, 4, 1, 6, 3, 6, 1, 3, 18 (list; graph; listen)

	OFFSET	`1,3`
	CROSSREFS	`Cf. A000005, A034444, A001222.` `Sequence in context: A096110 A103161 A030420 this_sequence A054708 A112229 A087419` `Adjacent sequences: A133899 A133900 A133901 this_sequence A133903 A133904 A133905`
	KEYWORD	`nonn`
	AUTHOR	`Ctibor O. Zizka (ctibor.zizka(AT)seznam.cz), Jan 07 2008`

page 1

Search completed in 0.002 seconds

Last modified December 4 21:35 EST 2008. Contains 151309 sequences.

AT&T Labs Research