OFFSET
1,5
COMMENTS
a(i) <= a(j) for i < j.
A number and the sum of its digits have the same value modulo 9. Hence all terms are divisible by 9. - Stefan Steinerberger, Apr 01 2006
A192977 gives number of occurrences of multiples of 9. - Reinhard Zumkeller, Aug 04 2011
Margaret Coffey (ed.) p. 440: "The sum of the digits of a two-digit prime number is subtracted from the number. Prove that the difference cannot be a prime number." Proof [p.442] "Let a and b be the tens and units digits, respectively, and let 10a+b be the prime. Subtract the sum of the digits from the number: 10a + b - (a+b) = 9a. The difference is a multiple of 9 and cannot, therefore, be prime." - Jonathan Vos Post, Feb 02 2012
LINKS
Reinhard Zumkeller, Table of n, a(n) for n = 1..10000
Margaret Coffey, Editor, Problem #3, Calendar, Mathematics Teacher, March 2012, pp. 440-442.
EXAMPLE
a(10) = 29 - (2+9) = 18.
MATHEMATICA
Table[Prime[n] - Sum[DigitCount[Prime[n]][[i]]*i, {i, 1, 9}], {n, 1, 60}] (* Stefan Steinerberger, Apr 01 2006 *)
#-Total[IntegerDigits[#]]&/@Prime[Range[60]] (* Harvey P. Dale, Oct 14 2014 *)
PROG
(Haskell)
a068395 n = a068395_list !! (n-1)
a068395_list = zipWith (-) a000040_list a007605_list
-- Reinhard Zumkeller, Aug 04 2011
CROSSREFS
KEYWORD
nonn,nice,base
AUTHOR
Reinhard Zumkeller, Mar 08 2002
EXTENSIONS
More terms from Stefan Steinerberger, Apr 01 2006
STATUS
approved