Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A074484
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A074484 a(n) = b(A074483(n), n), where b(k) is the recursion: b(1,n)=1, b(k+1,n)=b(k,n) + (b(k,n) reduced mod(k+n)) (cf. A074482). +0
3
38606, 38606, 38606, 8, 48, 48, 192, 192, 304, 96, 16, 304, 304, 72, 44, 160, 1170558326, 160, 96, 128, 190, 392472, 1980, 6560, 3304, 32, 6560, 6560, 114, 22348, 6240, 230, 392472, 5920, 5920, 5920, 592362276, 592362276, 18154867024, 18154867024 (list; graph; listen)
OFFSET

0,1

COMMENT

a(n) = A074482(n)*(A074483(n)+ n + 1).

LINKS

David W. Wilson, Table of n, a(n) for n = 0..10000

EXAMPLE

a(0) = A073117(A074483(0)) = A073117(397) = 38606.

CROSSREFS

Cf. A074482, A074483, A073117.

Sequence in context: A050765 A013873 A050766 this_sequence A043666 A088237 A031823

Adjacent sequences: A074481 A074482 A074483 this_sequence A074485 A074486 A074487

KEYWORD

nonn

AUTHOR

Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com) and Benoit Cloitre (benoit7848c(AT)orange.fr), Aug 23 2002

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 September 5 19:27 EDT 2008. Contains 143485 sequences.


AT&T Labs Research