id:A133904 - OEIS Search Results

Search: id:A133904

Displaying 1-1 of 1 results found.

page 1

a(n)= gcd(a(n-1),n)*a(n-1) + d(n) if a(n-1) is not divisible by 2 else a(n)= a(n-1)/2, where gcd denotes common divisor, d(n) is number of divisors of n.

+0
1

1, 2, 1, 3, 6, 3, 13, 15, 19, 22, 11, 123, 375, 377, 381, 1147, 1152, 576, 288, 144, 72, 36, 18, 9, 17, 20, 10, 5, 11, 13, 21, 23, 29, 33, 37, 41, 50, 25, 29, 33, 41, 1683, 5055, 5057, 5063, 5069, 5073, 5075, 5085, 5088, 2544, 1272, 636, 368, 184, 92, 46, 23 (list; graph; listen)

	OFFSET	`1,2`
	CROSSREFS	`Cf. A001222, A000005.` `Sequence in context: A006895 A125205 A125206 this_sequence A094339 A120576 A063707` `Adjacent sequences: A133901 A133902 A133903 this_sequence A133905 A133906 A133907`
	KEYWORD	`nonn`
	AUTHOR	`Ctibor O. Zizka (ctibor.zizka(AT)seznam.cz), Jan 07 2008`

page 1

Search completed in 0.002 seconds

Last modified November 25 08:46 EST 2009. Contains 167481 sequences.

AT&T Labs Research