Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A094328
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A094328 Iterate the map in A006368 starting at 4. +0
3
4, 5, 7, 9, 6, 4, 5, 7, 9, 6, 4, 5, 7, 9, 6, 4, 5, 7, 9, 6, 4, 5, 7, 9, 6, 4, 5, 7, 9, 6, 4, 5, 7, 9, 6, 4, 5, 7, 9, 6, 4, 5, 7, 9, 6, 4, 5, 7, 9, 6, 4, 5, 7, 9, 6, 4, 5, 7, 9, 6, 4, 5, 7, 9, 6, 4, 5, 7, 9, 6, 4, 5, 7, 9, 6, 4, 5, 7, 9, 6, 4, 5, 7, 9, 6, 4, 5, 7, 9, 6, 4, 5, 7, 9, 6, 4, 5, 7, 9, 6, 4, 5, 7, 9, 6 (list; graph; listen)
OFFSET

1,1

LINKS

J. C. Lagarias, The 3x+1 problem and its generalizations, Amer. Math. Monthly, 92 (1985), 3-23.

FORMULA

The map is: n -> if n mod 3 = 0 then 2*n/3 elif n mod 3 = 1 then (4*n-1)/3 else (4*n+1)/3.

Periodic.

a(n)=(1/50)*{51*(n mod 5)+61*[(n+1) mod 5]+11*[(n+2) mod 5]+11*[(n+3) mod 5]+21*[(n+4) mod 5]}, with n>=0 - Paolo P. Lava (ppl(AT)spl.at), Jun 26 2007

CROSSREFS

Cf. A006368, A028394-A028397, A094329.

Sequence in context: A140076 A135186 A011336 this_sequence A081095 A080596 A032492

Adjacent sequences: A094325 A094326 A094327 this_sequence A094329 A094330 A094331

KEYWORD

nonn

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com), Jun 04 2004

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 6 22:55 EST 2009. Contains 170429 sequences.


AT&T Labs Research