Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A058361
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A058361 a(n) is the least k in A002977 with a gap of n. Also n + a(n) is the least k in A007448 which is repeated n times. +0
2
3, 1, 4, 15, 22, 121, 735, 31, 46, 22143, 4468, 67, 31455, 391, 2308, 447, 94, 33151, 16383, 139, 202, 7551, 5224, 787, 1595391, 3685, 580, 30591, 418, 42495, 1791, 607, 1342, 3217407, 1095166, 283, 398847, 32767, 365311, 88575, 1174, 6925, 12304383 (list; graph; listen)
OFFSET

1,1

MATHEMATICA

k = {1}; Do[ k = Union[ Join[ k, 2k + 1, 3k + 1 ] ]; l = Length[ k ]; i = 1; While[ i < l && k[ [ i ] ] < 10^9, i++ ]; k = Take[ k, {1, i} ], {n, 1, 30} ]; f[ n_Integer ] := (i = 1; While[ k[ [ i + 1 ] ] - k[ [ i ] ] != n, i++ ]; k[ [ i ] ]); Table[ f[ n ], {n, 1, 84} ]

CROSSREFS

Cf. A002977, A007448.

Sequence in context: A095328 A066712 A064809 this_sequence A112668 A016734 A125846

Adjacent sequences: A058358 A058359 A058360 this_sequence A058362 A058363 A058364

KEYWORD

nonn

AUTHOR

Robert G. Wilson v (rgwv(AT)rgwv.com), Dec 16 2000

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 July 25 07:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research