login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A010801 13th powers: a(n) = n^13. 4
0, 1, 8192, 1594323, 67108864, 1220703125, 13060694016, 96889010407, 549755813888, 2541865828329, 10000000000000, 34522712143931, 106993205379072, 302875106592253, 793714773254144, 1946195068359375 (list; graph; refs; listen; history; internal format)
OFFSET

0,3

COMMENTS

a(n) mod 10 = n mod 10. - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Dec 06 2004

Totally multiplicative sequence with a(p) = p^13 for prime p. Multiplicative sequence with a(p^e) = p^(13*e). [From Jaroslav Krizek (jaroslav.krizek(AT)atlas.cz), Nov 01 2009]

LINKS

Vincenzo Librandi, Table of n, a(n) for n = 0..1000

MATHEMATICA

Range[0, 30]^13 (*From Vladimir Joseph Stephan Orlovsky, Mar 14 2011*)

PROG

(MAGMA) [n^13: n in [0..15]]; // Vincenzo Librandi, Jun 19 2011

CROSSREFS

Cf. A000290, A000578, A000583, A000584.

Sequence in context: A069274 A195661 A017690 * A138031 A035908 A017689

Adjacent sequences:  A010798 A010799 A010800 * A010802 A010803 A010804

KEYWORD

nonn,easy,mult

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 12:41 EST 2012. Contains 205909 sequences.