This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A250131 a(n) is the odd part of the digital sum of 3^n divided by the maximal possible power of 3. 0
 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 5, 1, 1, 1, 5, 1, 5, 1, 5, 1, 1, 7, 7, 1, 1, 1, 7, 1, 7, 1, 11, 1, 1, 5, 5, 1, 5, 11, 5, 1, 5, 11, 1, 7, 13, 1, 1, 13, 13, 5, 1, 5, 5, 1, 7, 13, 11, 5, 17, 17, 1, 5, 13, 1, 17, 17, 1, 5, 1, 17, 19, 5, 17, 1 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,14 COMMENTS Consider the sequence {b(n)}, such that b(1)=2, b(2)=3, and for n>=3, b(n)=a(n-2). We conjecture that, if we apply the Eratosthenes-like sieve to b(n) and remove 1's, then we obtain a sequence of primes. Peter J. C. Moses noted that these primes follow with some perturbation of order. For example, 73 appears before 71. Similarly, 101 and 103 appear before 97. LINKS PROG (PARI) a(n) = my(sd = sumdigits(3^n)); sd/(3^(valuation(sd, 3))*2^(valuation(sd, 2))); \\ Michel Marcus, Dec 12 2014 CROSSREFS Cf. A221858, A225039, A225093, A251964. Sequence in context: A293235 A066803 A089608 * A100615 A293897 A222119 Adjacent sequences:  A250128 A250129 A250130 * A250132 A250133 A250134 KEYWORD nonn AUTHOR Vladimir Shevelev, Dec 12 2014 EXTENSIONS More terms from Peter J. C. Moses, Dec 12 2014 STATUS approved

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

Last modified May 23 20:23 EDT 2019. Contains 323528 sequences. (Running on oeis4.)