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!)
A242479 Primes p such that, in base 17, p = the cumulative sum of the digit-mult(digit-sum(prime)) of each prime <= p. 0
105701, 160309, 927137, 927149, 964973, 2329081, 2329097, 2329549, 2384587, 3228733, 3237527, 3242851, 7338377, 7338431, 7338557, 7338719 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
FORMULA
The function digit-mult(n) multiplies all digits d of n, where d > 0. For example, digit-mult(1230) = 1 * 2 * 3 = 6. Therefore, in base 17, digit-mult(digit-sum(9999)) = digit-mult(22) = 2 * 2 = 4 (22 in base 17 = 36 in base 10).
EXAMPLE
105701 = digit-mult(digit-sum(2)) + digit-mult(digit-sum(3)) + ... digit-mult(digit-sum(148CC)) = digit-mult(2) + digit-mult(3) + ... digit-mult(23) = 2 + 3 + ... 2*3. Note that 148CC and 23 in base 17 = 105701 and 37 in base 10.
CROSSREFS
Cf. A240886.
Sequence in context: A353553 A025308 A025290 * A252775 A210410 A184649
KEYWORD
nonn,base
AUTHOR
Anthony Sand, May 16 2014
STATUS
approved

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 May 4 18:21 EDT 2024. Contains 372257 sequences. (Running on oeis4.)