Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A073437
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A073437 Smallest x such that remainder Mod[A065855(x), A000720(x)]=n. +0
3
4, 6, 8, 21, 22, 25, 26, 27, 30, 33, 66, 70, 77, 78, 82, 86, 87, 88, 92, 93, 94, 95, 96, 100, 116, 117, 118, 119, 120, 219, 220, 221, 222, 247, 248, 249, 250, 255, 256, 261, 262, 267, 268, 289, 290, 291, 292, 297, 298, 299, 300, 301, 302, 303, 304, 305, 306, 323 (list; graph; listen)
OFFSET

1,1

EXAMPLE

Remainder 4 appears first as Mod[G[21],Pi[21]]= Mod[21-Pi[21]-1,Pi[21]]=Mod[21-8-1,8]=Mod[12,8]=4, so a(4)=21.

CROSSREFS

Cf. A065855, A000720, A073435, A073436.

Adjacent sequences: A073434 A073435 A073436 this_sequence A073438 A073439 A073440

Sequence in context: A132040 A114315 A058238 this_sequence A019196 A083790 A086561

KEYWORD

nonn

AUTHOR

Labos E. (labos(AT)ana.sote.hu), Jul 31 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 October 10 20:39 EDT 2008. Contains 144831 sequences.


AT&T Labs Research