Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A007612
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A007612 a(n+1) = a(n) + digital root (A010888) of a(n).
(Formerly M1114)
+0
7
1, 2, 4, 8, 16, 23, 28, 29, 31, 35, 43, 50, 55, 56, 58, 62, 70, 77, 82, 83, 85, 89, 97, 104, 109, 110, 112, 116, 124, 131, 136, 137, 139, 143, 151, 158, 163, 164, 166, 170, 178, 185, 190, 191, 193, 197, 205, 212, 217, 218, 220, 224, 232, 239, 244, 245, 247, 251 (list; graph; listen)
OFFSET

1,2

REFERENCES

J. Roberts, Lure of the Integers, Math. Assoc. America, 1992, p. 65.

LINKS

T. D. Noe, Table of n, a(n) for n=1..1000

Eric Weisstein's World of Mathematics, Link to a section of The World of Mathematics.

FORMULA

a(1) = 1, a(n+1) = a(n) + a(n) mod 9. - Reinhard Zumkeller (reinhard.zumkeller(AT)lhsystems.com), Mar 23 2003

n == 1, 2, 4, 8, 16, or 23 (mod 27). - Dean Hickerson (dean(AT)math.ucdavis.edu), Mar 25 2003

Lim a(n)/n = 9/2 for n --> oo; A029898(n)=a(n+1)-a(n)=A010888(a(n)). - Reinhard Zumkeller (reinhard.zumkeller(AT)lhsystems.com), Feb 27 2006

a(6n+1)=27n+1, a(6n+2)=27n+2, a(6n+3)=27n+4, a(6n+4)=27n+8, a(6n+5)=27n+16, a(6n+6)=27n+23. - Frank Adams-Watters (FrankTAW(AT)Netscape.net), Mar 13 2006

CROSSREFS

Cf. A004207.

Adjacent sequences: A007609 A007610 A007611 this_sequence A007613 A007614 A007615

Sequence in context: A063108 A058961 A130917 this_sequence A112395 A004207 A062729

KEYWORD

nonn,base,nice

AUTHOR

njas, Robert G. Wilson v (rgwv(AT)rgwv.com), Mira Bernstein (mira(AT)math.berkeley.edu)

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 May 16 01:24 EDT 2008. Contains 139630 sequences.


AT&T Labs Research