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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A028835 Numbers n such that iterated sum of digits of n is a prime. 6
2, 3, 5, 7, 11, 12, 14, 16, 20, 21, 23, 25, 29, 30, 32, 34, 38, 39, 41, 43, 47, 48, 50, 52, 56, 57, 59, 61, 65, 66, 68, 70, 74, 75, 77, 79, 83, 84, 86, 88, 92, 93, 95, 97, 101, 102, 104, 106, 110, 111, 113, 115, 119, 120, 122, 124, 128, 129, 131, 133, 137, 138, 140, 142, 146, 147, 149, 151, 155, 156 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

Also numbers n such that n modulo 9 is an element of {2,3,5,7}. Hence as n tends to infinity, a(n)/n converges against 9/4 quite rapidly. - Stefan Steinerberger, Apr 23 2006

LINKS

Reinhard Zumkeller, Table of n, a(n) for n = 1..10000

EXAMPLE

38 -> 3 + 8 = 11 -> 1 + 1 = 2 is a prime.

MATHEMATICA

Select[Range[200], PrimeQ[Mod[ #, 9]] &] (* Stefan Steinerberger, Apr 23 2006 *)

PROG

(Haskell)

import Data.List (findIndices)

a028835 n = a028835_list !! (n-1)

a028835_list = findIndices (`elem` [2, 3, 5, 7]) $ map a010888 [0..]

-- Reinhard Zumkeller, Oct 21 2011

CROSSREFS

Cf. A010888, A028834, A028843.

Sequence in context: A212166 A293511 A212127 * A028834 A070026 A139750

Adjacent sequences:  A028832 A028833 A028834 * A028836 A028837 A028838

KEYWORD

nonn,base,easy,nice

AUTHOR

N. J. A. Sloane

EXTENSIONS

Extended (and corrected) by Scott Lindhurst (ScottL(AT)alumni.princeton.edu)

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified February 19 14:27 EST 2018. Contains 299333 sequences. (Running on oeis4.)