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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A122640 a(n) = {2n}_n. 5

%I #15 Jul 04 2022 11:02:25

%S 2,4,6,8,5,8,11,14,17,20,24,28,32,36,45,50,55,60,65,80,86,92,98,104,

%T 125,132,139,146,153,180,188,196,204,212,245,254,263,272,281,320,330,

%U 340,350,360,405,416,427,438,449,2500,2603,2708,2815,2924,3080,3194,3310,3428,3548

%N a(n) = {2n}_n.

%C See A122618 for notation.

%H Michael De Vlieger, <a href="/A122640/b122640.txt">Table of n, a(n) for n = 1..10000</a>

%p a:= n-> (l-> add(l[i]*n^(i-1), i=1..nops(l)))(convert(2*n, base, 10)):

%p seq(a(n), n=1..60); # _Alois P. Heinz_, Jul 04 2022

%t Array[FromDigits[IntegerDigits[2 #], #] &, 59] (* _Michael De Vlieger_, Jul 04 2022 *)

%o (PARI) a(n) = fromdigits(digits(2*n),max(2,n)); \\ _Kevin Ryde_, Jul 04 2022

%Y Cf. A122618 (n_n).

%K nonn,base,easy

%O 1,1

%A _N. J. A. Sloane_, Sep 21 2006

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 19:49 EDT 2024. Contains 371963 sequences. (Running on oeis4.)