Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A129904
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A129904 Find the first two terms in A003215, say A003215(i) and A003215(j), that are divisible by a number in A016921 not 1, say by k = A016921(m). Then i + j + 1 = k and k is added to the sequence. +0
1
7, 13, 19, 31, 37, 43, 49 (list; graph; listen)
OFFSET

1,1

EXAMPLE

A003215(1) = 7 is divisible by A016921(1) = 7, A003215(5) = 91 is divisible by A016921(1) = 7, and 5+1+1=7, so 7 is a member.

CROSSREFS

Cf. A003215, A016921.

Adjacent sequences: A129901 A129902 A129903 this_sequence A129905 A129906 A129907

Sequence in context: A059647 A059310 A101324 this_sequence A088513 A004611 A133290

KEYWORD

nonn

AUTHOR

Mats Granvik (mgranvik(AT)abo.fi), Jun 04 2007

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 October 6 12:54 EDT 2008. Contains 144667 sequences.


AT&T Labs Research