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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A140497 a(n) = 2p - number of digits of p^p, where p = n-th prime. 0
3, 4, 6, 8, 10, 11, 13, 13, 14, 15, 15, 15, 15, 15, 15, 14, 13, 13, 11, 10, 9, 8, 6, 4, 1, -1, -2, -4, -5, -6, -14, -16, -19, -20, -26, -28, -31, -35, -38, -42, -46, -47, -54, -56, -59, -60, -69, -78, -81, -83 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

MAPLE

a:=proc(n) local np, npp: np:=ithprime(n): npp:=convert(np^np, base, 10); 2*np-nops(npp) end proc: seq(a(n), n=1..50); [From Emeric Deutsch (deutsch(AT)duke.poly.edu), Aug 10 2008]

MATHEMATICA

2#-IntegerLength[#^#]&/@Prime[Range[50]] (* From Harvey P. Dale, Nov 01 2011 *)

CROSSREFS

Sequence in context: A135251 A088070 A175071 * A187343 A189573 A029900

Adjacent sequences:  A140494 A140495 A140496 * A140498 A140499 A140500

KEYWORD

base,sign

AUTHOR

Juri-Stepan Gerasimov (2stepan(AT)rambler.ru), Jul 24 2008

EXTENSIONS

Corrected and extended by Emeric Deutsch (deutsch(AT)duke.poly.edu), Aug 10 2008

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 14 05:53 EST 2012. Contains 205570 sequences.