Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A113604
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A113604 Define f(k) = k + sum of digits of n. a(n) is the first prime that results by applying f zero or more times to n, or 0 if no such prime exists. +0
1
2, 2, 3, 23, 5, 0, 7, 23, 0, 11, 11, 0, 13, 19, 0, 23, 17, 0, 19, 41, 0, 41, 23, 0, 37, 41, 0, 101, 29, 0, 31, 37, 0, 41, 43, 0, 37, 101, 0, 59, 41, 0, 43, 59, 0, 67, 47, 0, 101, 89, 0, 59, 53, 0, 89, 67, 0, 71, 59, 0, 61, 101, 0, 127, 89, 0, 67, 103, 0, 101, 71, 0, 73, 127, 0, 89 (list; graph; listen)
page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 15 00:47 EST 2009. Contains 170825 sequences.


AT&T Labs Research