This site is supported by donations to The OEIS Foundation.

 Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing. Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A004682 Primes written in base 8. 4
 2, 3, 5, 7, 13, 15, 21, 23, 27, 35, 37, 45, 51, 53, 57, 65, 73, 75, 103, 107, 111, 117, 123, 131, 141, 145, 147, 153, 155, 161, 177, 203, 211, 213, 225, 227, 235, 243, 247, 255, 263, 265, 277, 301, 305, 307, 323, 337, 343, 345, 351, 357, 361, 373, 401, 407, 415, 417 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS Vincenzo Librandi, Table of n, a(n) for n = 1..1000 C. P. Simoes, Teste de Desempenho Mental (in Portuguese). FORMULA a(n) = A007094(prime(n)). - Michel Marcus, Sep 03 2016 MATHEMATICA FromDigits/@IntegerDigits[Prime[Range[50]], 8] (* Vincenzo Librandi, Sep 03 2016 *) PROG (PARI) a(n)=subst(Pol(digits(prime(n), 8)), 'x, 10) \\ Charles R Greathouse IV, Nov 06 2013 (PARI) vector(60, n, fromdigits(digits(prime(n), 8))) \\ G. C. Greubel, Oct 10 2018 (MAGMA) [Seqint(Intseq(NthPrime(n), 8)): n in [1..60]]; // G. C. Greubel, Oct 10 2018 CROSSREFS Cf. similar sequences listed in A004680. Cf. A007094. Sequence in context: A168484 A217907 A031344 * A173105 A024783 A092855 Adjacent sequences:  A004679 A004680 A004681 * A004683 A004684 A004685 KEYWORD nonn,easy,base AUTHOR 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 December 10 12:30 EST 2019. Contains 329895 sequences. (Running on oeis4.)