

A126069


Generates A001350, the associated Mersenne numbers; A001350(n)=Product[a(d)] for dn.


1



1, 1, 4, 5, 11, 4, 29, 9, 19, 11, 199, 4, 521, 29, 31, 49, 3571, 19, 9349, 25, 211, 199, 64079, 36, 15251
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,3


REFERENCES

A 2001 Iranian Mathematical Olympiad question shows that such a generating sequence {a(n)} exists for the sequence {S(n)} whenever gcd(S(m),S(n)) = S(gcd(m,n)).


LINKS

Table of n, a(n) for n=1..25.


EXAMPLE

The divisors of 6 are 1,2,3,6 and a(1)*a(2)*a(3)*a(6)=1*1*4*4=16, which is, in fact, A001350(6).


CROSSREFS

Cf. A001350, A061446.
Sequence in context: A074098 A196270 A295656 * A147559 A322655 A206028
Adjacent sequences: A126066 A126067 A126068 * A126070 A126071 A126072


KEYWORD

nonn


AUTHOR

John W. Layman, Feb 28 2007


STATUS

approved



