The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A199922 Table read by rows, T(0,0) = 1 and for n>0, 0<=k<=3^(n-1) T(n,k) = gcd(k,3^(n-1)). 1
 1, 1, 1, 3, 1, 1, 3, 9, 1, 1, 3, 1, 1, 3, 1, 1, 9, 27, 1, 1, 3, 1, 1, 3, 1, 1, 9, 1, 1, 3, 1, 1, 3, 1, 1, 9, 1, 1, 3, 1, 1, 3, 1, 1, 27, 81, 1, 1, 3, 1, 1, 3, 1, 1, 9, 1, 1, 3, 1, 1, 3, 1, 1, 9, 1, 1, 3, 1, 1, 3, 1, 1, 27, 1, 1, 3, 1, 1, 3, 1, 1, 9, 1, 1, 3, 1 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,4 LINKS EXAMPLE 1             1, 1          3, 1, 1, 3 9, 1, 1, 3, 1, 1, 3, 1, 1, 9 MAPLE seq(print(seq(gcd(k, 3^(n-1)), k=0..3^(n-1))), n=0..4); CROSSREFS Cf. A198069. Sequence in context: A132740 A106621 A011085 * A112508 A260883 A088749 Adjacent sequences:  A199919 A199920 A199921 * A199923 A199924 A199925 KEYWORD nonn,tabf AUTHOR Peter Luschny, Nov 12 2011 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified June 29 14:08 EDT 2022. Contains 354913 sequences. (Running on oeis4.)