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!)
A301478 a(n) is the product of the n-th term of A301382 and its initial digit. 1

%I #21 May 11 2018 01:44:40

%S 1,4,9,10,11,12,13,14,15,16,17,18,19,25,36,40,42,44,46,48,49,50,52,54,

%T 56,58,64,81,90,93,96,99,100,101,102,103,104,105,106,107,108,109,110,

%U 111,112,113,114,115,116,117,118,119,120,121,122,123,124,125,126,127,128,129,130,131

%N a(n) is the product of the n-th term of A301382 and its initial digit.

%C The sequence is monotonically increasing, as stated in the Definition section of A301382.

%C Equivalently, these are the numbers of the form k * A000030(k) for some k > 0. - _Rémy Sigrist_, Mar 22 2018

%H Jean-Marc Falcoz, <a href="/A301478/b301478.txt">Table of n, a(n) for n = 1..10000</a>

%e P is the product a(n) * [the first digit of a(n)] for every term of A301382:

%e a(1) = 1 is the product P = 1 * 1,

%e a(2) = 4 is the product P = 2 * 2,

%e a(3) = 9 is the product P = 3 * 3,

%e a(4) = 10 is the product P = 10 * 1,

%e a(5) = 11 is the product P = 11 * 1,

%e a(6) = 12 is the product P = 12 * 1,

%e Etc.

%o (PARI) p = vector(131, k, oo); for (n=1, #p, x = n*digits(n)[1]; if (x<=#p, p[x] = min(p[x], n))); for (k=1, #p, if (p[k] != oo, print1 (p[k]*digits(p[k])[1] ", "))) \\ _Rémy Sigrist_, Mar 22 2018

%Y Cf. A000030, A301382.

%K nonn,base

%O 1,2

%A _Eric Angelini_ and _Jean-Marc Falcoz_, Mar 22 2018

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 August 13 06:03 EDT 2024. Contains 375113 sequences. (Running on oeis4.)